Method and device for control information transmission in a wireless communication system

ABSTRACT

The present invention relates to a wireless communication system. More particularly, the present invention relates to a method for transmitting control information through a PUCCH in a wireless system and to a device therefore.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is the National Stage filing under 35 U.S.C. 371 ofInternational Application No. PCT/KR2011/002940, filed on Apr. 22, 2011,which claims the benefit of earlier filing date and right of priority toKorean Patent Application No. 10-2010-0129070, filed on Dec. 16, 2010,and also claims the benefit of U.S. Provisional Application Serial No.61/326,661, filed on Apr. 22, 2010, the contents of which are all herebyincorporated by reference herein in their entirety.

TECHNICAL FIELD

The present invention relates to a wireless communication system, andmore particularly to a method and apparatus for transmitting controlinformation in a wireless communication system supporting carrieraggregation (CA).

BACKGROUND ART

Wireless communication systems have been widely used to provide variouskinds of communication services such as voice or data services.Generally, a wireless communication system is a multiple access systemthat can communicate with multiple users by sharing available systemresources (bandwidth, transmission (Tx) power, and the like). A varietyof multiple access systems can be used. For example, a Code DivisionMultiple Access (CDMA) system, a Frequency Division Multiple Access(FDMA) system, a Time Division Multiple Access (TDMA) system, anOrthogonal Frequency Division Multiple Access (OFDMA) system, a SingleCarrier Frequency-Division Multiple Access (SC-FDMA) system, and thelike.

DISCLOSURE Technical Problem

Accordingly, the present invention is directed to a method and apparatusfor efficiently transmitting control information in a wirelesscommunication system that substantially obviate one or more problems dueto limitations and disadvantages of the related art. An object of thepresent invention is to provide a method and apparatus for efficientlytransmitting control information in a wireless communication system.Another object of the present invention is to provide a channel formatand signal processing for effectively transmitting control information,and an apparatus for the channel format and the signal processing. Afurther object of the present invention is to provide a method andapparatus for effectively allocating resources for transmitting controlinformation.

It will be appreciated by persons skilled in the art that the objectsthat can be achieved through the present invention are not limited towhat has been particularly described hereinabove and the above and otherobjects that the present invention can achieve will be more clearlyunderstood from the following detailed description taken in conjunctionwith the accompanying drawings.

Technical Solution

The object of the present invention can be achieved by providing amethod for transmitting control information through a Physical UplinkControl Channel (PUCCH) by a user equipment (UE) in a wirelesscommunication system, the method including: obtaining a first modulationsymbol and a second modulation symbol from the control information;spreading the first modulation symbol to a plurality of subcarriers in afrequency domain; spreading the first modulation symbol spread in thefrequency domain to a plurality of first contiguous SC-FDMA symbols in atime domain; spreading the second modulation symbol to a plurality ofsubcarriers in a frequency domain; spreading the second modulationsymbol spread in the frequency domain to the plurality of secondcontiguous SC-FDMA symbols in a time domain; and transmitting the spreadfirst modulation symbol and the spread second modulation symbol throughthe PUCCH, wherein the plurality of first contiguous SC-FDMA symbols andthe plurality of second contiguous SC-FDMA symbols are located in thesame slot.

In another aspect of the present invention, a user equipment (UE)configured to transmit control information through a physical uplinkcontrol channel (PUCCH) in a wireless communication system includes: aradio frequency (RF) unit; and a processor, wherein the processorobtains a first modulation symbol and a second modulation symbol fromthe control information, spreads the first modulation symbol to aplurality of subcarriers in a frequency domain, spreads the firstmodulation symbol spread in the frequency domain to a plurality of firstcontiguous SC-FDMA symbols in a time domain, spreads the secondmodulation symbol to a plurality of subcarriers in a frequency domain,spreads the second modulation symbol spread in the frequency domain tothe plurality of second contiguous SC-FDMA symbols in a time domain, andtransmits the spread first modulation symbol and the spread secondmodulation symbol through the PUCCH, wherein the plurality of firstcontiguous SC-FDMA symbols and the plurality of second contiguousSC-FDMA symbols are located in the same slot.

The first modulation symbol and the second modulation symbol may beobtained from channel-coded control information.

The control information may include a plurality of control information,and the first modulation symbol and the second modulation symbol may beobtained from a single codeword generated through joint coding.

The first modulation symbol may be transmitted using any one of aplurality of resources occupied in the plurality of first contiguousSC-FDMA symbols, and the second modulation symbol may be transmittedusing any one of a plurality of resources occupied in the plurality ofsecond contiguous SC-FDMA symbols.

An index related to a first resource from among a plurality of resourcesoccupied for the first or second modulation symbol may be decided by aControl Channel Element (CCE) index used for Physical Downlink ControlChannel (PDCCH) transmission, and an index related to a second resourcemay be decided by the index related to the first resource and an offsetvalue.

A sequence used for time-domain spreading of the first modulation symboland the second modulation symbol may have a spreading factor (SF) of 2(SF=2).

A sequence used for frequency-domain spreading of the first modulationsymbol and the second modulation symbol may include a Constant AmplitudeZero Auto Correlation (CAZAC) sequence or a Computer Generated(CG)-CAZAC sequence.

Advantageous Effects

Exemplary embodiments of the present invention have the followingeffects. Control information can be effectively transmitted in awireless system. In addition, the embodiments of the present inventioncan provide a channel format and a signal processing method toeffectively transmit control information. In addition, resources fortransmitting control information can be effectively assigned.

It will be appreciated by persons skilled in the art that the effectsthat can be achieved through the present invention are not limited towhat has been particularly described hereinabove and other advantages ofthe present invention will be more clearly understood from the followingdetailed description taken in conjunction with the accompanyingdrawings.

DESCRIPTION OF DRAWINGS

The accompanying drawings, which are included to provide a furtherunderstanding of the invention, illustrate embodiments of the inventionand together with the description serve to explain the principle of theinvention.

FIG. 1 is a conceptual diagram illustrating physical channels used in a3GPP LTE system acting as an exemplary mobile communication system and ageneral method for transmitting a signal using the physical channels.

FIG. 2 is a conceptual diagram illustrating a method for processing anuplink signal.

FIG. 3 is a conceptual diagram illustrating a method for processing adownlink signal.

FIG. 4 is a conceptual diagram illustrating an SC-FDMA scheme and anOFDMA scheme applicable to embodiments of the present invention.

FIG. 5 is a conceptual diagram illustrating a signal mapping scheme in afrequency domain so as to satisfy single carrier characteristics.

FIG. 6 is a conceptual diagram illustrating the signal processing formapping DFT process output samples to a single carrier in a clusteredSC-FDMA.

FIGS. 7 and 8 show the signal processing in which DFT process outputsamples are mapped to multiple carriers in a clustered SC-FDMA.

FIG. 9 shows exemplary segmented SC-FDMA signal processing.

FIG. 10 shows an uplink subframe structure.

FIG. 11 is a conceptual diagram illustrating a signal processingprocedure for transmitting a reference signal (RS) on uplink.

FIG. 12 shows demodulation reference signal (DMRS) structures for aphysical uplink shared channel (PUSCH).

FIGS. 13 and 14 exemplarily show slot level structures of PUCCH formats1a and 1b.

FIGS. 15 and 16 exemplarily show slot level structures of PUCCH formats2/2a/2b.

FIG. 17 is a diagram showing ACK/NACK channelization of PUCCH formats 1aand 1b.

FIG. 18 is a diagram showing channelization of a structure in whichPUCCH formats 1/1a/1b and PUCCH formats 2/2a/2b are mixed within thesame PRB.

FIG. 19 is a diagram showing allocation of a physical resourceallocation (PRB) used to transmit a PUCCH.

FIG. 20 is a conceptual diagram of management of a downlink componentcarrier (DL CC) in a base station (BS).

FIG. 21 is a conceptual diagram of management of an uplink componentcarrier (UL CC) in a user equipment (UE).

FIG. 22 is a conceptual diagram of the case where one MAC layer managesmultiple carriers in a BS.

FIG. 23 is a conceptual diagram of the case where one MAC layer managesmultiple carriers in a UE.

FIG. 24 is a conceptual diagram of the case where one MAC layer managesmultiple carriers in a BS.

FIG. 25 is a conceptual diagram of the case where a plurality of MAClayers manages multiple carriers in a UE.

FIG. 26 is a conceptual diagram of the case where a plurality of MAClayers manages multiple carriers in a BS according to one embodiment ofthe present invention.

FIG. 27 is a conceptual diagram of the case where a plurality of MAClayers manages multiple carriers from the viewpoint of UE receptionaccording to another embodiment of the present invention.

FIG. 28 is a diagram showing asymmetric carrier aggregation (CA) inwhich a plurality of downlink component carriers (DL CCs) and one uplinkCC are linked.

FIGS. 29 and 30 show that Spreading Factor (SF) reduction is applied toSlot 0 contained in a subframe according to one embodiment of thepresent invention.

FIG. 31 shows a PUCCH format to which joint coding and SF reduction areapplied, and signal processing for the PUCCH format according to oneembodiment of the present invention.

FIG. 32 shows a PUCCH format to which channel selection and SF reductionare applied, and signal processing for the PUCCH format according to oneembodiment of the present invention.

FIGS. 33 and 34 show QPSK constellation illustrating the mapping ruleaccording to embodiments of the present invention.

FIG. 35 is a block diagram illustrating precoding applied to channelselection according to one embodiment of the present invention.

FIG. 36 exemplarily shows 8QPSK constellation based on gray mapping.

FIGS. 37 and 38 exemplarily show a transmit diversity method accordingto one embodiment of the present invention.

FIGS. 39 and 40 exemplarily show a transmit diversity method accordingto another embodiment of the present invention.

FIGS. 41 and 42 exemplarily show a transmit diversity method accordingto another embodiment of the present invention.

FIG. 43 is a block diagram illustrating a base station (BS) and a userequipment (UE) applicable to embodiments of the present invention.

BEST MODE

Reference will now be made in detail to the preferred embodiments of thepresent invention with reference to the accompanying drawings. Thedetailed description, which will be given below with reference to theaccompanying drawings, is intended to explain exemplary embodiments ofthe present invention, rather than to show the only embodiments that canbe implemented according to the invention. The following embodiments ofthe present invention can be applied to a variety of wireless accesstechnologies, for example, CDMA, FDMA, TDMA, OFDMA, SC-FDMA, MC-FDMA,and the like. CDMA can be implemented by wireless communicationtechnologies, such as Universal Terrestrial Radio Access (UTRA) orCDMA2000. TDMA can be implemented by wireless communicationtechnologies, for example, Global System for Mobile communications(GSM), General Packet Radio Service (GPRS), Enhanced Data rates for GSMEvolution (EDGE), etc. OFDMA can be implemented by wirelesscommunication technologies, for example, IEEE 802.11 (Wi-Fi), IEEE802.16 (WiMAX), IEEE 802.20, E-UTRA (Evolved UTRA), and the like. UTRAis a part of the Universal Mobile Telecommunications System (UMTS). 3rdGeneration Partnership Project (3GPP) Long Term Evolution (LTE) is apart of Evolved UMTS (E-UMTS) that uses E-UTRA. The LTE-Advanced (LTE-A)is an evolved version of 3GPP LTE. Although the following embodiments ofthe present invention will hereinafter describe inventive technicalcharacteristics on the basis of the 3GPP LTE/LTE-A system, it should benoted that the following embodiments will be disclosed only forillustrative purposes and the scope and spirit of the present inventionare not limited thereto.

In a wireless communication system, the UE may receive information fromthe base station (BS) via a downlink, and may transmit information viaan uplink. The information that is transmitted and received to and fromthe UE includes data and a variety of control information. A variety ofphysical channels are used according to categories of transmission (Tx)and reception (Rx) information of the UE.

FIG. 1 is a conceptual diagram illustrating physical channels for use ina 3GPP system and a general method for transmitting a signal using thephysical channels.

Referring to FIG. 1, when powered on or when entering a new cell, a UEperforms initial cell search in step S101. The initial cell searchinvolves synchronization with a BS. Specifically, the UE synchronizeswith the BS and acquires a cell Identifier (ID) and other information byreceiving a Primary Synchronization CHannel (P-SCH) and a SecondarySynchronization CHannel (S-SCH) from the BS. Then the UE may acquireinformation broadcast in the cell by receiving a Physical BroadcastCHannel (PBCH) from the BS. During the initial cell search, the UE maymonitor a downlink channel status by receiving a downlink ReferenceSignal (DL RS).

After initial cell search, the UE may acquire more specific systeminformation by receiving a Physical Downlink Control CHannel (PDCCH) andreceiving a Physical Downlink Shared CHannel (PDSCH) based oninformation of the PDCCH in step S102.

Thereafter, if the UE initially accesses the BS, it may perform randomaccess to the BS in steps S103 to S106. For random access, the UE maytransmit a preamble to the BS on a Physical Random Access CHannel(PRACH) in step S103 and receive a response message for the randomaccess on a PDCCH and a PDSCH corresponding to the PDCCH in step S104.In the case of contention-based random access, the UE may transmit anadditional PRACH in step S105, and receive a PDCCH and a PDSCHcorresponding to the PDCCH in step S106 in such a manner that the UE canperform a contention resolution procedure.

After the above random access procedure, the UE may receive aPDCCH/PDSCH (S107) and transmit a Physical Uplink Shared CHannel(PDSCH)/Physical Uplink Control CHannel (PUCCH) (S108) in a generaluplink/downlink signal transmission procedure. Control information thatthe UE transmits to the BS is referred to as uplink control information(UCI). The UCI includes a Hybrid Automatic Repeat and reQuestACKnowledgment/Negative-ACK (HARQ ACK/NACK) signal, a Scheduling Request(SR), Channel Quality Indictor (CQI), a Precoding Matrix Index (PMI),and a Rank Indicator (RI). The UCI is transmitted on a PUSCH, ingeneral. However, the UCI can be transmitted on a PUSCH when controlinformation and traffic data need to be transmitted simultaneously.Furthermore, the UCI can be aperiodically transmitted on a PUSCH at therequest/instruction of a network.

FIG. 2 is a conceptual diagram illustrating a signal processing methodfor transmitting an uplink signal by a user equipment (UE).

Referring to FIG. 2, the scrambling module 201 may scramble atransmission signal in order to transmit the uplink signal. Thescrambled signal is input to the modulation mapper 202, such that themodulation mapper 202 modulates the scrambled signal to complex symbolsin Binary Phase Shift Keying (BPSK), Quadrature Phase Shift Keying(QPSK), or 16-ary Quadrature Amplitude Modulation (16QAM) according tothe type of the transmission signal and/or a channel status. A transformprecoder 203 processes the complex symbols and a resource element mapper204 may map the processed complex symbols to time-frequency resourceelements, for actual transmission. The mapped signal may be transmittedto the BS through an antenna after being processed in a SingleCarrier-Frequency Division Multiple Access (SC-FDMA) signal generator205.

FIG. 3 is a conceptual diagram illustrating a signal processing methodfor transmitting a downlink signal by a base station (BS).

Referring to FIG. 3, the BS can transmit one or more codewords via adownlink in a 3GPP LTE system. Codewords may be processed as complexsymbols by the scrambling module 301 and the modulation mapper 302 inthe same manner as in the uplink operation shown in FIG. 2. Thereafter,the complex symbols are mapped to a plurality of layers by the layermapper 303, and each layer is multiplied by a predetermined precodingmatrix and is then allocated to each transmission antenna by theprecoder 304. The processed transmission signals of individual antennasare mapped to time-frequency resource elements (REs) to be used for datatransmission by the RE mapper 305. Thereafter, the mapped result may betransmitted via each antenna after passing through the OFDMA signalgenerator 306.

In the case where a UE for use in a wireless communication systemtransmits an uplink signal, a Peak to Average Power Ratio (PAPR) maybecome more serious than in the case where the BS transmits a downlinksignal. Thus, as described in FIGS. 2 and 3, the SC-FDMA scheme is usedfor uplink signal transmission in a different way from the OFDMA schemeused for downlink signal transmission.

FIG. 4 is a conceptual diagram illustrating an SC-FDMA scheme and anOFDMA scheme applicable to embodiments of the present invention. In the3GPP system, the OFDMA scheme is used in downlink and the SC-FDMA schemeis used in uplink.

Referring to FIG. 4, not only a UE for uplink signal transmission butalso a BS for downlink signal transmission includes a Serial-to-Parallelconverter 401, a subcarrier mapper 403, an M-point IDFT module 404 and aCyclic Prefix (CP) addition module 406. However, a UE for transmitting asignal using the SC-FDMA scheme further includes an N-point DFT module402, and compensates for a predetermined part of the IDFT processinginfluence of the M-point IDFT module 1504 so that a transmission signalcan have single carrier characteristics (i.e., single-carrierproperties).

FIG. 5 illustrates a signal mapping scheme in the frequency domain forsatisfying the single carrier properties. FIG. 5 (a) shows a localizedmapping scheme and FIG. 5 (b) shows a distributed mapping scheme.

A clustered SC-FDMA scheme which is a modified form of the SC-FDMAscheme is described as follows. In the clustered SC-FDMA scheme, DFTprocess output samples are divided into sub-groups in a subcarriermapping procedure and are non-contiguously mapped in the frequencydomain (or subcarrier domain).

FIG. 6 shows signal processing in which DFT-process output samples aremapped to one carrier in the clustered SC-FDMA. FIGS. 7 and 8 showsignal processing in which DFT process output samples are mapped tomulticarriers in a clustered SC-FDMA. FIG. 6 shows the example ofintra-carrier cluster SC-FDMA application. FIGS. 7 and 8 show examplesof the inter-carrier clustered SC-FDMA application. FIG. 7 shows theexample in which a signal is generated through a single IFFT block underthe condition that component carriers are contiguously allocated to afrequency domain and the subcarrier spacing between contiguous componentcarriers is arranged. FIG. 8 shows another example in which a signal isgenerated through several IFFT blocks under the condition that componentcarriers are non-contiguously allocated to a frequency domain.

FIG. 9 shows exemplary segmented SC-FDMA signal processing.

The segmented SC-FDMA to which the same number of IFFTs as an arbitrarynumber of DFTs is applied may be considered to be an extended version ofthe conventional SC-FDMA DFT spread and the IFFT frequency subcarriermapping structure because the relationship between DFT and IFFT isone-to-one basis. If necessary, the segmented SC-FDMA may also berepresented by NxSC-FDMA or NxDFT-s-OFDMA. For convenience ofdescription and better understanding of the present invention, thesegmented SC-FDMA, NxSC-FDMA and NxDFT-s-OFDMA may be genericallyreferred to as ‘segment SC-FDMA’. Referring to FIG. 9, in order toreduce single carrier characteristics, the segment SC-FDMA groups allthe time domain modulation symbols into N groups, such that a DFTprocess is performed in units of a group.

FIG. 10 shows an uplink subframe structure.

As shown in FIG. 10, the UL subframe includes a plurality of slots(e.g., two slots). Each slot may include a plurality of SC-FDMA symbols,the number of which varies according to the length of a CP. For example,in the case of a normal CP, a slot may include seven SC-FDMA symbols. AUL subframe is divided into a data region and a control region. The dataregion includes a PUSCH and is used to transmit a data signal such asvoice. The control region includes a PUCCH and is used to transmitcontrol information. The PUCCH includes a pair of RBs (e.g., m=0, 1, 2,3) located at both ends of the data region on the frequency axis(specifically, a pair of RBs at frequency mirrored locations) and hopsbetween slots. The UL control information (i.e., UCI) includes HARQACK/NACK, Channel Quality Information (CQI), Precoding Matrix Indicator(PMI), and Rank Indication (RI).

FIG. 11 illustrates a signal processing procedure for transmitting aReference Signal (RS) in the uplink. As shown in FIG. 11, data istransformed into a frequency domain signal by a DFT precoder and thesignal is then transmitted after being subjected to frequency mappingand IFFT. On the other hand, an RS does not pass through the DFTprecoder. More specifically, an RS sequence is directly generated in thefrequency domain (S11) and is then transmitted after being sequentiallysubjected to a localized-mapping process (S12), an IFFT process (S13),and a CP attachment process (S14).

The RS sequence r_(u,ν) ^((α))(n) is defined by a cyclic shift α of abase sequence and may be expressed by the following equation 1.r _(u,ν) ^((α))(n)=e ^(jαn) r _(u,ν)(n),0≦n≦M _(sc) ^(RS)  [Equation 1]

where M_(sc) ^(RS)=mN_(sc) ^(RB) denotes the length of the RS sequence,N_(sc) ^(RB) denotes the size of a resource block represented insubcarriers, and m is 1≦m≦N_(RB) ^(max,UL). N_(RB) ^(max,UL) denotes amaximum UL transmission band.

A base sequence r _(u,ν)(n) is divided into several groups. uε{0, 1, . .. , 29} denotes group number, and ν corresponds to a base sequencenumber in a corresponding group. Each group includes one base sequenceν=0 having a length of M_(sc) ^(RS)=mN_(sc) ^(RB) (1≦m≦5) and two basesequences ν=0,1 having a length of M_(sc) ^(RS)=mN_(sc) ^(RB)(6≦m≦N_(RB) ^(max,UL)). The sequence group number u and the number vwithin a corresponding group may be changed with time. The base sequencer _(u,ν)(0), . . . , r _(u,ν)(M_(sc) ^(RS)−1) is defined based on asequence length M_(sc) ^(RS).

The base sequence having a length of 3N_(sc) ^(RB) or more may bedefined as follows.

With respect to M_(sc) ^(RS)≧3N_(sc) ^(RB), the base sequence r_(u,ν)(0), . . . , r _(u,ν)(M_(sc) ^(RS)−1) is given by the followingequation 2.r _(u,ν)(n)=x _(q)(n mod N _(ZC) ^(RS)),0≦n<M _(sc) ^(RS),  [Equation 2]

where a q-th root Zadoff-Chu sequence may be defined by the followingequation 3.

$\begin{matrix}{{{x_{q}(m)} = {\mathbb{e}}^{{- j}\frac{\pi\; q\;{m{({m + 1})}}}{N_{ZC}^{RS}}}},{0 \leq m \leq {N_{ZC}^{RS} - 1}},} & \left\lbrack {{Equation}\mspace{14mu} 3} \right\rbrack\end{matrix}$

where q satisfies the following equation 4.q=└ q +1/2┘+ν·(−1)^(└2 q┘)q=N _(ZC) ^(RS)·(u+1)/31  [Equation 4]

where the length N_(ZC) ^(RS′) of the Zadoff-Chue sequence is given bythe largest prime number, thus satisfying M_(ZC) ^(RS)<M_(sc) ^(RS).

A base sequence having a length of less than 3N_(sc) ^(RB) may bedefined as follows. First, for M_(sc) ^(RS)=N_(sc) ^(RB) and M_(sc)^(RS)=2N_(sc) ^(RB), the base sequence is given as shown in Equation 5.r _(u,ν)(n)=e ^(jφ(n)π/4),0≦n≦M _(sc) ^(RS)−1,  [Equation 5]

where values φ(n) for M_(sc) ^(RS)=N_(sc) ^(RB) and M_(sc) ^(RS)=2N_(sc)^(RB) are given by the following Table 1, respectively.

TABLE 1 u φ(0), . . . , φ(11) 0 −1 1 3 −3 3 3 1 1 3 1 −3 3 1 1 1 3 3 3−1 1 −3 −3 1 −3 3 2 1 1 −3 −3 −3 −1 −3 −3 1 −3 1 −1 3 −1 1 1 1 1 −1 −3−3 1 −3 3 −1 4 −1 3 1 −1 1 −1 −3 −1 1 −1 1 3 5 1 −3 3 −1 −1 1 1 −1 −1 3−3 1 6 −1 3 −3 −3 −3 3 1 −1 3 3 −3 1 7 −3 −1 −1 −1 1 −3 3 −1 1 −3 3 1 81 −3 3 1 −1 −1 −1 1 1 3 −1 1 9 1 −3 −1 3 3 −1 −3 1 1 1 1 1 10 −1 3 −1 11 −3 −3 −1 −3 −3 3 −1 11 3 1 −1 −1 3 3 −3 1 3 1 3 3 12 1 −3 1 1 −3 1 1 1−3 −3 −3 1 13 3 3 −3 3 −3 1 1 3 −1 −3 3 3 14 −3 1 −1 −3 −1 3 1 3 3 3 −11 15 3 −1 1 −3 −1 −1 1 1 3 1 −1 −3 16 1 3 1 −1 1 3 3 3 −1 −1 3 −1 17 −31 1 3 −3 3 −3 −3 3 1 3 −1 18 −3 3 1 1 −3 1 −3 −3 −1 −1 1 −3 19 −1 3 1 31 −1 −1 3 −3 −1 −3 −1 20 −1 −3 1 1 1 1 3 1 −1 1 −3 −1 21 −1 3 −1 1 −3 −3−3 −3 −3 1 −1 −3 22 1 1 −3 −3 −3 −3 −1 3 −3 1 −3 3 23 1 1 −1 −3 −1 −3 1−1 1 3 −1 1 24 1 1 3 1 3 3 −1 1 −1 −3 −3 1 25 1 −3 3 3 1 3 3 1 −3 −1 −13 26 1 3 −3 −3 3 −3 1 −1 −1 3 −1 −3 27 −3 −1 −3 −1 −3 3 1 −1 1 3 −3 −328 −1 3 −3 3 −1 3 3 −3 3 3 −1 −1 29 3 −3 −3 −1 −1 −3 −1 3 −3 3 1 −1

TABLE 2 u φ(0), . . . , φ(23) 0 −1 3 1 −3 3 −1 1 3 −3 3 1 3 −3 3 1 1 −11 3 −3 3 −3 −1 −3 1 −3 3 −3 −3 −3 1 −3 −3 3 −1 1 1 1 3 1 −1 3 −3 −3 1 31 1 −3 2 3 −1 3 3 1 1 −3 3 3 3 3 1 −1 3 −1 1 1 −1 −3 −1 −1 1 3 3 3 −1 −31 1 3 −3 1 1 −3 −1 −1 1 3 1 3 1 −1 3 1 1 −3 −1 −3 −1 4 −1 −1 −1 −3 −3 −11 1 3 3 −1 3 −1 1 −1 −3 1 −1 −3 −3 1 −3 −1 −1 5 −3 1 1 3 −1 1 3 1 −3 1−3 1 1 −1 −1 3 −1 −3 3 −3 −3 −3 1 1 6 1 1 −1 −1 3 −3 −3 3 −3 1 −1 −1 1−1 1 1 −1 −3 −1 1 −1 3 −1 −3 7 −3 3 3 −1 −1 −3 −1 3 1 3 1 3 1 1 −1 3 1−1 1 3 −3 −1 −1 1 8 −3 1 3 −3 1 −1 −3 3 −3 3 −1 −1 −1 −1 1 −3 −3 −3 1 −3−3 −3 1 −3 9 1 1 −3 3 3 −1 −3 −1 3 −3 3 3 3 −1 1 1 −3 1 −1 1 1 −3 1 1 10−1 1 −3 −3 3 −1 3 −1 −1 −3 −3 −3 −1 −3 −3 1 −1 1 3 3 −1 1 −1 3 11 1 3 3−3 −3 1 3 1 −1 −3 −3 −3 3 3 −3 3 3 −1 −3 3 −1 1 −3 1 12 1 3 3 1 1 1 −1−1 1 −3 3 −1 1 1 −3 3 3 −1 −3 3 −3 −1 −3 −1 13 3 −1 −1 −1 −1 −3 −1 3 3 1−1 1 3 3 3 −1 1 1 −3 1 3 −1 −3 3 14 −3 −3 3 1 3 1 −3 3 1 3 1 1 3 3 −1 −1−3 1 −3 −1 3 1 1 3 15 −1 −1 1 −3 1 3 −3 1 −1 −3 −1 3 1 3 1 −1 −3 −3 −1−1 −3 −3 −3 −1 16 −1 −3 3 −1 −1 −1 −1 1 1 −3 3 1 3 3 1 −1 1 −3 1 −3 1 1−3 −1 17 1 3 −1 3 3 −1 −3 1 −1 −3 3 3 3 −1 1 1 3 −1 −3 −1 3 −1 −1 −1 181 1 1 1 1 −1 3 −1 −3 1 1 3 −3 1 −3 −1 1 1 −3 −3 3 1 1 −3 19 1 3 3 1 −1−3 3 −1 3 3 3 −3 1 −1 1 −1 −3 −1 1 3 −1 3 −3 −3 20 −1 −3 3 −3 −3 −3 −1−1 −3 −1 −3 3 1 3 −3 −1 3 −1 1 −1 3 −3 1 −1 21 −3 −3 1 1 −1 1 −1 1 −1 31 −3 −1 1 −1 1 −1 −1 3 3 −3 −1 1 −3 22 −3 −1 −3 3 1 −1 −3 −1 −3 −3 3 −33 −3 −1 1 3 1 −3 1 3 3 −1 −3 23 −1 −1 −1 −1 3 3 3 1 3 3 −3 1 3 −1 3 −1 33 −3 3 1 −1 3 3 24 1 −1 3 3 −1 −3 3 −3 −1 −1 3 −1 3 −1 −1 1 1 1 1 −1 −1−3 −1 3 25 1 −1 1 −1 3 −1 3 1 1 −1 −1 −3 1 1 −3 1 3 −3 1 1 −3 −3 −1 −126 −3 −1 1 3 1 1 −3 −1 −1 −3 3 −3 3 1 −3 3 −3 1 −1 1 −3 1 1 1 27 −1 −3 33 1 1 3 −1 −3 −1 −1 −1 3 1 −3 −3 −1 3 −3 −1 −3 −1 −3 −1 28 −1 −3 −1 −1 1−3 −1 −1 1 −1 −3 1 1 −3 1 −3 −3 3 1 1 −1 3 −1 −1 29 1 1 −1 −1 −3 −1 3 −13 −1 1 3 1 −1 3 1 3 −3 −3 1 −1 −1 1 3

RS hopping is described below.

The sequence group number u in a slot n_(s) may be defined as shown inthe following equation 6 by a group hopping pattern f_(gh)(n_(s)) and asequence shift pattern f_(ss).u =(f _(gh)(n _(s))+f _(ss))mod 30  [Equation 6]

where mod denotes a modulo operation.

17 different hopping patterns and 30 different sequence shift patternsare present. Sequence group hopping may be enabled or disabled by aparameter for activating group hopping provided by a higher layer.

Although the PUCCH and the PUSCH have the same hopping pattern, thePUCCH and the PUSCH may have different sequence shift patterns.

The group hopping pattern f_(gh)(n_(s)) is the same for the PUSCH andthe PUCCH and is given by the following equation 7.

                                     [Equation  7]${f_{gh}\left( n_{s} \right)} = \left\{ {\begin{matrix}0 & {{if}\mspace{14mu}{group}\mspace{14mu}{hopping}\mspace{14mu}{is}\mspace{14mu}{disabled}} \\{\left( {\sum\limits_{i = 0}^{7}{{c\left( {{8n_{s}} + i} \right)} \cdot 2^{i}}} \right){mod}\; 30} & {{if}\mspace{14mu}{group}\mspace{14mu}{hopping}\mspace{14mu}{is}\mspace{14mu}{enabled}}\end{matrix},} \right.$

where c(i) denotes a pseudo-random sequence and a pseudo-random sequencegenerator may be initialized by

$c_{init} = \left\lfloor \frac{N_{ID}^{cell}}{30} \right\rfloor$at the start of each radio frame.

The definition of the sequence shift pattern f_(ss) varies between thePUCCH and the PUSCH.

The sequence shift pattern f_(ss) ^(PUCCH) of the PUCCH is f_(ss)^(PUCCH)=N_(ID) ^(cell) mod30 and the sequence shift pattern f_(ss)^(PUSCH) of the PUSCH is f_(ss) ^(PUSCH)=(f_(ss) ^(PUCCH)+Δ_(ss))mod 30.Δ_(ss)ε{0, 1, . . . , 29} is configured by a higher layer.

The following is a description of sequence hopping.

Sequence hopping is applied only to an RS having a length of M_(sc)^(RS)≧6N_(sc) ^(RB).

For an RS having a length of M_(sc) ^(RS)<6N_(sc) ^(RB), a base sequencenumber ν within a base sequence group is v=0.

For an RS having a length of M_(sc) ^(RS)≧6N_(sc) ^(RB), a base sequencenumber ν within a base sequence group in a slot n_(s) is given by thefollowing equation 8.

$\begin{matrix}{v = \left\{ {\begin{matrix}{c\left( n_{s} \right)} & \begin{matrix}{{if}\mspace{14mu}{group}\mspace{14mu}{hopping}\mspace{14mu}{is}\mspace{14mu}{disabled}\mspace{14mu}{and}} \\{{sequence}\mspace{14mu}{hopping}\mspace{14mu}{is}\mspace{14mu}{enabled}}\end{matrix} \\0 & {otherwise}\end{matrix}.} \right.} & \left\lbrack {{Equation}\mspace{14mu} 8} \right\rbrack\end{matrix}$

where c(i) denotes a pseudo-random sequence and a parameter for enablingsequence hopping provided by a higher layer determines whether or notsequence hopping is possible. The pseudo-random sequence generator maybe initialized as

$c_{init} = {{\left\lfloor \frac{N_{ID}^{cell}}{30} \right\rfloor \cdot 2^{5}} + f_{ss}^{PUSCH}}$at the start of a radio frame.

An RS for a PUSCH is determined in the following manner.

The RS sequence r^(PUSCH)(•) for the PUCCH is defined asr^(PUSCH)(m·M_(sc) ^(RS)+n)=r_(u, ν) ^((α))(n). Here, m and n satisfy

m = 0, 1 n = 0, … , M_(ss)^(RS) − 1and satisfy M_(sc) ^(RS)=M_(sc) ^(PUSCH).

A cyclic shift in one slot is given by α=2n_(cs)/12 together withn_(cs)=(n_(DRMS) ⁽¹⁾+n_(DMRS) ⁽²⁾+n_(PRS)(n_(s)))mod12.

Here, n_(DRMS) ⁽¹⁾ is a broadcast value, n_(DMRS) ⁽²⁾ is given by ULscheduling allocation, and n_(PRS)(n_(s)) is a cell-specific cyclicshift value. n_(PRS)(n_(s)) varies according to a slot number n_(s), andis given by n_(PRS)(n_(s))=Σ_(i=0) ⁷c(8·n_(s)+i)·2^(i).

c(i) is a pseudo-random sequence and c(i) is also a cell-specific value.The pseudo-random sequence generator may be initialized as

$c_{init} = {{\left\lfloor \frac{N_{ID}^{cell}}{30} \right\rfloor \cdot 2^{5}} + f_{ss}^{PUSCH}}$at the start of a radio frame.

Table 3 shows a cyclic shift field and n_(DMRS) ⁽²⁾ at a downlinkcontrol information (DCI) format 0.

TABLE 3 Cyclic shift field at DCI format 0 n_(DMRS) ⁽²⁾ 000 0 001 2 0103 011 4 100 6 101 8 110 9 111 10

A physical mapping method for a UL RS at a PUSCH is as follows.

A sequence is multiplied by an amplitude scaling factor β_(PUSCH) and ismapped to the same physical resource block (PRB) set used for thecorresponding PUSCH within the sequence that starts at r^(PUSCH)(0).When the sequence is mapped to a resource element (k, l) (l=3 for anormal CP and l=2 for an extended CP) within a subframe, the order of kis first increased and the slot number is then increased.

In summary, a ZC sequence is used along with cyclic extension if thelength is greater than or equal to 3N_(sc) ^(RB) and acomputer-generated sequence is used if the length is less than 3N_(sc)^(RB). The cyclic shift is determined according to a cell-specificcyclic shift, a UE-specific cyclic shift, a hopping pattern, and thelike.

FIG. 12A illustrates the structure of a demodulation reference signal(DMRS) for a PUSCH in the case of normal CP and FIG. 12B illustrates thestructure of a DMRS for a PUSCH in the case of extended CP. In thestructure of FIG. 12A, a DMRS is transmitted through fourth and eleventhSC-FDMA symbols and, in the structure of FIG. 12B, a DMRS is transmittedthrough third and ninth SC-FDMA symbols.

FIGS. 13 to 16 illustrate a slot level structure of a PUCCH format. ThePUCCH includes the following formats in order to transmit controlinformation.

-   -   (1) Format 1: Used for on-off keying (OOK) modulation and        scheduling request (SR)    -   (2) Format 1a and Format 1b: Used for ACK/NACK transmission        -   1) Format 1a: BPSK ACK/NACK for one codeword        -   2) Format 1b: QPSK ACK/NACK for two codewords    -   (3) Format 2: Used for QPSK modulation and CQI transmission    -   (4) Format 2a and Format 2b: Used for CQI and ACK/NACK        simultaneous transmission.

Table 4 shows a modulation scheme and the number of bits per subframeaccording to PUCCH format. Table 5 shows the number of RSs per slotaccording to PUCCH format. Table 6 shows SC-FDMA symbol locations of anRS according to PUCCH format. In Table 4, the PUCCH formats 2a and 2bcorrespond to the case of normal CP.

TABLE 4 PUCCH Number of bits per format Modulation scheme subframe,M_(bit) 1 N/A N/A 1a BPSK 1 1b QPSK 2 2 QPSK 20 2a QPSK + BPSK 21 2bQPSK + BPSK 22

TABLE 5 PUCCH format Normal CP Extended CP 1, 1a, 1b 3 2 2 2 1 2a, 2b 2N/A

TABLE 6 PUCCH SC-FDMA symbol location of RS format Normal CP Extended CP1, 1a, 1b 2, 3, 4 2, 3 2, 2a, 2b 1, 5 3

FIG. 13 shows a PUCCH format 1a and 1b structure in the case of a normalCP. FIG. 14 shows a PUCCH format 1a and 1b structure in the case of anextended CP. In the PUCCH format 1a and 1b structure, the same controlinformation is repeated in each slot within a subframe. UEs transmitACK/NACK signals through different resources that include orthogonalcovers or orthogonal cover codes (OCs or OCCs) and different cyclicshifts (i.e., different frequency domain codes) of a Computer-GeneratedConstant Amplitude Zero Auto Correlation (CG-CAZAC) sequence. Forexample, the OCs may include orthogonal Walsh/DFT codes. When the numberof CSs is 6 and the number of OCs is 3, a total of 18 UEs may bemultiplexed in the same Physical Resource Block (PRB) based on a singleantenna. Orthogonal sequences w0, w1, w2, and w3 may be applied to anarbitrary time domain (after FFT modulation) or an arbitrary frequencydomain (before FFT modulation).

For SR and persistent scheduling, ACK/NACK resources composed of CSs,OCs and PRBs may be assigned to UEs through Radio Resource Control(RRC). For dynamic ACK/NACK and non-persistent scheduling, ACK/NACKresources may be implicitly assigned to the UE using the lowest CCEindex of a PDCCH corresponding to the PDSCH.

FIG. 15 shows a PUCCH format 2/2a/2b structure in the case of the normalCP. FIG. 16 shows a PUCCH format 2/2a/2b structure in the case of theextended CP. As shown in FIGS. 15 and 16, one subframe includes 10 QPSKdata symbols in addition to an RS symbol in the normal CP case. EachQPSK symbol is spread in the frequency domain by a CS and is then mappedto a corresponding SC-FDMA symbol. SC-FDMA symbol level CS hopping maybe applied in order to randomize inter-cell interference. RSs may bemultiplexed by CDM using a CS. For example, if it is assumed that thenumber of available CSs is 12 or 6, 12 or 6 UEs may be multiplexed inthe same PRB. For example, in PUCCH formats 1/1a/1b and 2/2a/2b, aplurality of UEs may be multiplexed by CS+OC+PRB and CS+PRB.

Length-4 and length-3 orthogonal sequences (OCs) for PUCCH formats1/1a/1b are shown in the following Tables 7 and 8.

TABLE 7 Length-4 orthogonal sequences for PUCCH formats 1/1a/1bOrthogonal sequences Sequence index n_(oc) (n_(s)) [w(0) . . . w(N_(SF)^(PUCCH) − 1)] 0 [+1 +1 +1 +1] 1 [+1 −1 +1 −1] 2 [+1 −1 −1 +1]

TABLE 8 Length-3 orthogonal sequences for PUCCH formats 1/1a/1bOrthogonal sequences Sequence index n_(oc) (n_(s)) [w(0) . . . w(N_(SF)^(PUCCH) − 1)] 0 [1 1 1] 1 [1 e^(j2π/3) e^(j4π/3)] 2 [1 e^(j4π/3)e^(j2π/3)]

The orthogonal sequences (OCs) for the RS in the PUCCH formats 1/1a/1bare shown in Table 9.

TABLE 9 1a and 1b Sequence index n _(oc) (n_(s)) Normal cyclic prefixExtended cyclic prefix 0 [1 1 1] [1 1] 1 [1 e^(j2π/3) e^(j4π/3)] [1 −1]2 [1 e^(j4π/3) e^(j2π/3)] N/A

FIG. 17 illustrates ACK/NACK channelization for PUCCH formats 1a and 1bwhen Δ_(shift) ^(PUCCH)=2.

FIG. 18 illustrates channelization of a structure in which PUCCH formats1/1a/1b and PUCCH formats 2/2a/2b are mixed within the same PRB.

CS (Cyclic Shift) hopping and OC (Orthogonal Cover) remapping may beapplied as follows.

-   -   (1) Symbol-based cell-specific CS hopping for inter-cell        interference randomization    -   (2) Slot level CS/OC remapping        -   1) For inter-cell interference randomization        -   2) Slot-based access for mapping between ACK/NACK channels            and resources (k)

A resource n_(r) for PUCCH formats 1/1a/1b includes the followingcombination.

-   -   (1) CS (=DFT OC in a symbol level) (n_(cs))    -   (2) OC (OC in a slot level) (n_(oc))    -   (3) Frequency RB (n_(rb))

When indices representing the CS, the OC and the RB are n_(cs), n_(oc)and n_(rb), respectively, a representative index n_(r) includes n_(cs),n_(oc) and n_(rb). That is, n_(r)=(n_(cs), n_(oc), n_(rb)).

A CQI, a PMI, an RI, and a combination of a CQI and an ACK/NACK may betransmitted through PUCCH formats 2/2a/2b. Here, Reed Muller (RM)channel coding may be applied.

For example, in the LTE system, channel coding for a UL CQI is describedas follows. A bit stream a₀, a₁, a₂, a₃, . . . , a_(A-1) ischannel-coded using a (20, A) RM code. Table 10 shows a base sequencefor the (20, A) code. a₀ and a_(A-1) represent a Most Significant Bit(MSB) and a Least Significant Bit (LSB), respectively. In the extendedCP case, the maximum number of information bits is 11, except when theCQI and the ACK/NACK are simultaneously transmitted. After the bitstream is coded into 20 bits using the RM code, QPSK modulation may beapplied to the encoded bits. Before QPSK modulation, the encoded bitsmay be scrambled.

TABLE 10 l M_(j,0) M_(j,1) M_(j,2) M_(j,3) M_(j,4) M_(j,5) M_(j,6)M_(j,7) M_(j,8) M_(j,9) M_(j,10) M_(j,11) M_(j,12) 0 1 1 0 0 0 0 0 0 0 01 1 0 1 1 1 1 0 0 0 0 0 0 1 1 1 0 2 1 0 0 1 0 0 1 0 1 1 1 1 1 3 1 0 1 10 0 0 0 1 0 1 1 1 4 1 1 1 1 0 0 0 1 0 0 1 1 1 5 1 1 0 0 1 0 1 1 1 0 1 11 6 1 0 1 0 1 0 1 0 1 1 1 1 1 7 1 0 0 1 1 0 0 1 1 0 1 1 1 8 1 1 0 1 1 00 1 0 1 1 1 1 9 1 0 1 1 1 0 1 0 0 1 1 1 1 10 1 0 1 0 0 1 1 1 0 1 1 1 111 1 1 1 0 0 1 1 0 1 0 1 1 1 12 1 0 0 1 0 1 0 1 1 1 1 1 1 13 1 1 0 1 0 10 1 0 1 1 1 1 14 1 0 0 0 1 1 0 1 0 0 1 0 1 15 1 1 0 0 1 1 1 1 0 1 1 0 116 1 1 1 0 1 1 1 0 0 1 0 1 1 17 1 0 0 1 1 1 0 0 1 0 0 1 1 18 1 1 0 1 1 11 1 0 0 0 0 0 19 1 0 0 0 0 1 1 0 0 0 0 0 0

Channel coding bits b₀, b₁, b₂, b₃, . . . , b_(B-1) may be generated byEquation 9.

$\begin{matrix}{{b_{i} = {\sum\limits_{n = 0}^{A - 1}{\left( {a_{n} \cdot M_{i,n}} \right){mod}\mspace{14mu} 2}}},} & \left\lbrack {{Equation}\mspace{14mu} 9} \right\rbrack\end{matrix}$

where i=0, 1, 2, . . . , B−1.

Table 11 shows an uplink control information (UCI) field for broadbandreporting (single antenna port, transmit diversity or open loop spatialmultiplexing PDSCH) CQI feedback.

TABLE 11 Field Bandwidth Wideband CQI 4 5

Table 12 shows a UCI field for wideband CQI and PMI feedback. The fieldreports closed loop spatial multiplexing PDSCH transmission.

TABLE 12 Bandwidth 2 antenna ports 4 antenna ports Field Rank = 1 Rank =2 Rank = 1 Rank > 1 Wideband CQI 4 4 4 4 Spatial differential CQI 0 3 03 PMI (Preceding 2 1 4 4 Matrix Index)

Table 13 shows a UCI field for RI feedback for wideband reporting.

TABLE 13 Bit widths 4 antenna ports 2 antenna Up to two Up to four Fieldports layers layers RI (Rank 1 1 2 Indication)

FIG. 19 shows PRB allocation. As shown in FIG. 19, the PRB may be usedfor PUCCH transmission in slot n_(s).

The term “multi-carrier system” or “carrier aggregation system” refersto a system for aggregating and utilizing a plurality of carriers havinga bandwidth smaller than a target bandwidth for broadband support. Whena plurality of carriers having a bandwidth smaller than a targetbandwidth is aggregated, the bandwidth of the aggregated carriers may belimited to a bandwidth used in the existing system for backwardcompatibility with the existing system. For example, the existing LTEsystem may support bandwidths of 1.4, 3, 5, 10, 15 and 20 MHz and anLTE-Advanced (LTE-A) system evolved from the LTE system may support abandwidth greater than 20 MHz using only the bandwidths supported by theLTE system. Alternatively, regardless of the bandwidths used in theexisting system, a new bandwidth may be defined so as to support carrieraggregation. The term “multi-carrier” may be used interchangeably withthe terms “carrier aggregation” and “bandwidth aggregation”. The term“carrier aggregation” may refer to both contiguous carrier aggregationand non-contiguous carrier aggregation.

FIG. 20 is a conceptual diagram illustrating management of downlinkcomponent carriers (DL CCs) in a base station (BS) and FIG. 21 is aconceptual diagram illustrating management of uplink component carriers(UL CCs) in a user equipment (UE). For ease of explanation, the higherlayer is simply described as a MAC (or a MAC entity) in the followingdescription of FIGS. 20 and 21.

FIG. 22 is a conceptual diagram illustrating management of multiplecarriers by one MAC entity in a BS. FIG. 23 is a conceptual diagramillustrating management of multiple carriers by one MAC entity in a UE.

As shown in FIGS. 22 and 23, one MAC manages and operates one or morefrequency carriers to perform transmission and reception. Frequencycarriers managed by one MAC need not be contiguous and as such they aremore flexible in terms of resource management. In FIGS. 22 and 23, it isassumed that one PHY (or PHY entity) corresponds to one componentcarrier (CC) for ease of explanation. One PHY does not always indicatean independent radio frequency (RF) device. Although one independent RFdevice generally corresponds to one PHY, the present invention is notlimited thereto and one RF device may include a plurality of PHYs.

FIG. 24 is a conceptual diagram illustrating management of multiplecarriers by a plurality of MAC entities in a BS. FIG. 25 is a conceptualdiagram illustrating management of multiple carriers by a plurality ofMAC entities in a UE. FIG. 26 illustrates another scheme of managementof multiple carriers by a plurality of MAC entities in a BS. FIG. 27illustrates another scheme of management of multiple carriers by aplurality of MAC entities in a UE.

Unlike the structures of FIGS. 22 and 23, a number of carriers may becontrolled by a number of MAC entities rather than by one MAC as shownin FIGS. 24 to 27.

As shown in FIGS. 24 and 25, carriers may be controlled by MACs on a oneto one basis. As shown in FIGS. 26 and 27, some carriers may becontrolled by MACs on a one to one basis and one or more remainingcarriers may be controlled by one MAC.

The above-mentioned system includes a plurality of carriers (i.e., 1 toN carriers) and carriers may be used so as to be contiguous ornon-contiguous to each other. This scheme may be equally applied to ULand DL. The TDD system is constructed so as to manage N carriers, eachincluding downlink and uplink transmission, and the FDD system isconstructed such that multiple carriers are applied to each of uplinkand downlink. The FDD system may also support asymmetrical carrieraggregation in which the numbers of carriers aggregated in uplink anddownlink and/or the bandwidths of carriers in uplink and downlink aredifferent.

When the number of component carriers (CCs) aggregated in uplink (UL) isidentical to the number of CCs aggregated in downlink (DL), all CCs maybe configured so as to be compatible with the conventional system.However, this does not mean that CCs that are configured without takinginto consideration such compatibility are excluded from the presentinvention.

Hereinafter, it is assumed for ease of explanation description that,when a PDCCH is transmitted through DL component carrier #0, a PDSCHcorresponding to the PDCCH is transmitted through DL component carrier#0. However, it is apparent that cross-carrier scheduling may be appliedsuch that the PDSCH is transmitted through a different DL componentcarrier. The term “component carrier” may be replaced with otherequivalent terms (e.g., cell).

FIG. 28 shows a scenario in which uplink control information (UCI) istransmitted in a radio communication system supporting carrieraggregation (CA). For ease of explanation, it is assumed in this examplethat the UCI is ACK/NACK (A/N). However, the UCI may include controlinformation such as channel state information (CSI) (e.g., CQI, PMI, RI,etc.) or scheduling request information (e.g., SR, etc.).

FIG. 28 shows asymmetric carrier aggregation in which 5 DL CCs and oneUL CC are linked. The illustrated asymmetric carrier aggregation may beset from the viewpoint of UCI transmission. That is, a DL CC-UL CClinkage for UCI and a DL CC-UL CC linkage for data may be setdifferently. When it is assumed for ease of explanation that one DL CCcan carry up to two codewords, at least two ACK/NACK bits are needed. Inthis case, in order to transmit an ACK/NACK for data received through 5DL CCs through one UL CC, at least 10 ACK/NACK bits are needed. In orderto also support a discontinuous transmission (DTX) state for each DL CC,at least 12 bits (=5⁵=3125=11.61 bits) are needed for ACK/NACKtransmission. The conventional PUCCH format 1a/1b structure cannottransmit such extended ACK/NACK information since the conventional PUCCHformat 1a/1b structure can transmit up to 2 ACK/NACK bits. Althoughcarrier aggregation has been illustrated as a cause of an increase inthe amount of UCI information, the amount of UCI information may also beincreased due to an increase in the number of antennas and the presenceof a backhaul subframe in a TDD system or a relay system. Similar to thecase of ACK/NACK, the amount of control information that should betransmitted is increased even when control information associated with aplurality of DL CCs is transmitted through one UL CC. For example, UCIpayload may be increased when there is a need to transmit a CQI/PMI/RIfor a plurality of DL CCs. DL CC may also be referred to as DL Cell, andUL CC may also be referred to as UL Cell. In addition, the anchor DL CCmay also be referred to as DL PCell, and the anchor UL CC may also bereferred to as UL PCell.

A DL primary CC may be defined as a DL CC linked with a UL primary CC.Here, linkage includes implicit and explicit linkage. In LTE, one DL CCand one UL CC are uniquely paired. For example, a DL CC that is linkedwith a UL primary CC by LTE pairing may be referred to as a DL primaryCC. This may be regarded as implicit linkage. Explicit linkage indicatesthat a network configures the linkage in advance and may be signaled byRRC or the like. In explicit linkage, a DL CC that is paired with a ULprimary CC may be referred to as a primary DL CC. A UL primary (oranchor) CC may be a UL CC in which a PUCCH is transmitted.Alternatively, the UL primary CC may be a UL CC in which UCI istransmitted through a PUCCH or a PUSCH. The DL primary CC may also beconfigured through higher layer signaling. The DL primary CC may be a DLCC in which a UE performs initial access. DL CCs other than the DLprimary CC may be referred to as DL secondary CCs. Similarly, UL CCsother than the UL primary CC may be referred to as UL secondary CCs.

DL-UL may correspond only to FDD. DL-UL pairing may not be defined forTDD since TDD uses the same frequency. In addition, a DL-UL linkage maybe determined from a UL linkage through UL E-UTRA Absolute RadioFrequency Channel Number (EARFCN) of SIB2. For example, the DL-ULlinkage may be acquired through SIB2 decoding when initial access isperformed and may be acquired through RRC signaling otherwise.Accordingly, only the SIB2 linkage may be present and other DL-ULpairing may not be defined. For example, in the 5DL:1UL structure ofFIG. 28, DL CC #0 and UL CC #0 may be in an SIB2 linkage relation witheach other and other DL CCs may be in an SIB2 linkage relation withother UL CCs which have not been set for the UE.

While some embodiments are focused on asymmetrical carrier aggregation,the present invention can be applied to various carrier aggregationscenarios including symmetrical carrier aggregation.

Embodiment: Transmission of Multiple UCIs using Spreading Factor (SF)Reduction

Hereinafter, the present invention proposes a method for efficientlytransmitting increased uplink control information with reference to theattached drawings. In more detail, the present invention proposes a newPUCCH format, a signal processing step, and a resource allocation methodfor transmitting increased uplink control information. For convenienceof description, the PUCCH format proposed by the present invention willhereinafter be referred to as PUCCH format 3 in terms of a new PUCCHformat, an LTE-A PUCCH format, or a PUCCH format 2 defined in the legacyLTE. Technical scope or spirit of the PUCCH format proposed by thepresent invention can be easily applied to an arbitrary physical channel(e.g., PUSCH) capable of transmitting uplink control information usingthe same or similar scheme. For example, the embodiment of the presentinvention can be applied to a periodic PUSCH structure for periodicallytransmitting control information or an aperiodic PUSCH structure foraperiodically transmitting control information.

The following drawings and embodiments will focus upon an exemplary casein which a UCI/RS symbol structure of a PUCCH format 1 (normal CP) ofthe legacy LTE is used as a UCI/RS symbol structure of a subframe/slotlevel applied to a PUCCH format of the embodiment of the presentinvention. However, the UCI/RS symbol structure of the subframe/slotlevel for use in the above PUCCH format is not limited thereto will bedisclosed only for illustrative purposes and the scope and spirit of thepresent invention are not limited thereto. In the PUCCH format of thepresent invention, the number of UCI/RS symbols, the location thereof,etc. can be freely modified according to a system design. For example,the PUCCH format according to the present invention can be defined usingthe PUCCH format 2/2a/2b structure of the legacy LTE.

The PUCCH format according to the embodiment of the present inventionmay be used to transmit arbitrary categorized/sized uplink controlinformation (UCI). For example, the PUCCH format according to theembodiment of the present invention may transmit a variety ofinformation, for example, HARQ ACK/NACK, CQI, PMI, RI, SR, etc., andthis information may have an arbitrary-sized payload. For convenience ofdescription, the present embodiment is focused upon the exemplary casein which PUCCH format transmits ACK/NACK information, and a detaileddescription thereof will be given later.

FIGS. 29 and 30 show that Spreading Factor (SF) reduction is applied toSlot 0 contained in a subframe according to one embodiment of thepresent invention. FIG. 29 shows the case of a normal CP, and FIG. 30shows the case of an extended CP. In the examples shown in FIGS. 29 and30, a spreading factor (SF) value of an OC for use in a PUCCH format ofthe legacy LTE is reduced from ‘4’ to ‘2’. Basic signal processing stepsof FIGS. 29 and 30 are identical to those of FIGS. 13 and 14.

Referring to FIGS. 29 and 30, information bits (e.g. ACK/NACK) areconverted into modulated symbols (symbols 0 and 1) through modulation(e.g. QPSK, 8PSK, 16QAM, 64QAM or the like). The modulated symbols aremultiplied by a base sequence r0, and a cyclic shift and an orthogonalcode (OC) ([w0 w1];[w2 w3]) with SF=2 are sequentially applied to themodulated symbols. Then, the modulated symbols to which the cyclic shiftand OC have been applied are subjected to IFFT to be mapped to SC-FDMAsymbols. Here, r0 includes a base sequence having a length of 12. The OCincludes a Walsh cover or a DFT code defined in LTE. Orthogonal codes[w0 w1] and [w2 w3] may be independently provided or may have the samevalue according to implementation scheme.

The legacy LTE PUCCH format 1a/1b can transmit only one modulated symbolin one slot because it uses SF=4. Furthermore, since the sameinformation is repeated on a slot basis, LTE PUCCH format 1a/1b cantransmit only one modulated symbol at a subframe level. Accordingly, LTEPUCCH formats can transmit ACK/NACK information having a maximum of 2bits in case of QPSK. However, the PUCCH format illustrated in FIGS. 29and 30 can transmit two modulated symbols per slot due to SF reduction.Furthermore, if slots are configured such that they transmit differentpieces of information, a maximum of 4 modulated symbols can betransmitted at the subframe level. Therefore, the illustrated PUCCHformat can transmit UCI (e.g. ACK/NACK) having a maximum of 8 bits incase of QPSK.

However, SF reduction can transmit (1) a maximum of 8 bits in case ofQPSK modulation; and (2) UCI having occupied four SC-FDMA symbols on aslot basis occupies two SC-FDMA symbols, so that energy per UCI is cutin half, resulting in a loss of 3 dB SNR (Signal to Noise Ratio).

A method for solving the above-mentioned problem will hereinafter bedescribed. The following embodiments may be implemented independently orcollectively.

The first scheme can perform joint coding of UCI. In other words,performance deterioration can be improved by a coding gain obtainedthrough the joint coding. The coding gain can be used either when muchmore UCIs can be transmitted simultaneously while maintaining the sameSNR, or when the same amount of UCI can be transmitted at a higher SNR.

The second scheme can solve the above-mentioned problem using channelselection. The channel selection means a method for transmitting

$\begin{pmatrix}M \\N\end{pmatrix} = \frac{M!}{{\left( {M - N} \right)!}{N!}}$information by selectively transmitting N resources from among a totalof M resources. For example, assuming that M=2 and N=1 are given andQPSK modulation (2 bits) are applied to the selected resources, a totalof 8 states (=3 bits) can be transmitted. That is, multiple orthogonalresources can be allocated and a resource selection domain can be usedto transmit UCI information. The resource selection domain may be usedeither when much more UCIs can be transmitted simultaneously whilemaintaining the same modulation order, or when the same amount of UCIcan be transmitted at a lower modulation order.

FIG. 31 shows a PUCCH format to which joint coding and SF reduction areapplied, and signal processing for the PUCCH format according to oneembodiment of the present invention. Since the basic processing of FIG.31 is identical to those of FIGS. 29 and 30, the following descriptionwill focus upon joint coding.

Referring to FIG. 31, the channel coding and rate matching blockperforms channel coding of information bits (a_0, a_1, . . . , a_M−1)(e.g., multiple ACK/NACK bits), such that it can generates the encodedbits (coded bits or coding bits) (or codewords) b_0, b_1, . . . , b_N−1.M is the size of information bits, and N is the size of coded bits. Theinformation bits may include uplink control information (UCI), forexample, multiple ACK/NACK information for multiple data (or PDSCH)received through a plurality of DL CCs. In this case, the informationbits (a_0, a_1, . . . , a_M−1) are joint-coded irrespective ofcategories/numbers/sizes of UCIs constructing the information bits. Forexample, if the information bits include multiple ACK/NACK data ofseveral DL CCs, channel coding is not performed per DL CC or perACK/NACK bit, but is performed for the entire bit information, such thata single codeword is generated. Channel coding is not limited thereto,and includes simple repetition, simplex coding, Reed Muller (RM) coding,punctured RM coding, Tail-biting convolutional coding (TBCC),low-density parity-check (LDPC) or turbo-coding. Although not shown inthe drawings, the coding bit may be rate-matched in consideration of amodulation order and the amount of resources. The rate matching mayinclude cyclic buffer rate matching or puncturing. The rate matchingfunction may be performed through a separate functional block, or may beomitted as necessary.

The modulator modulates the encoded bits (b_0, b_1, . . . , b_N−1) so asto generate the modulation symbols (c_0, c_1, . . . , c_L−1). Forexample, the modulation method may include n-PSK (Phase Shift Keying),n-QAM (Quadrature Amplitude Modulation) (where n is an integer of 2 orhigher). In more detail, the modulation method may include BPSK (BinaryPSK), QPSK (Quadrature PSK), 8-PSK, QAM, 16-QAM, 64-QAM, etc.

Although not shown in the drawings, the divider distributes themodulation symbols (0, 1, 2, 3) to individual slots. Theorder/pattern/scheme for distributing the modulation symbols toindividual slots is not specifically limited. For example, the dividermay sequentially distribute the modulation symbols to individual slotson the basis of the front part of the modulation symbols. In this case,as shown in the drawings, the modulation symbols (0, 1) are distributedto Slot 0 and the modulation symbols (2, 3) may be distributed to Slot1. In addition, the modulation symbols may be interleaved (or permuted)while being distributed to individual slots. For example, the even-thmodulation symbols may be distributed to Slot 1, and the odd-thmodulation symbols may be distributed to Slot 1. If necessary, themodulation process and the division process may be replaced with eachother in order. Thereafter, the modulation symbols distributed to slotsmay be multiplied by the base sequence (r0), cyclic shift (CS) isapplied to the resultant symbols, and OC (Orthogonal Code) ([w0 w1];[w2w3]) of SF=2 is applied to the CS result, IFFT is applied to the OCresult, and the IFFT result is mapped to SC-FDMA symbols.

The PUCCH format reduces an SF such that it can transmit many moremodulation symbols. Transmit energy (or SNR) per UCI reduced by SFreduction can be compensated by joint coding. In addition, the codinggain obtained by the joint coding may be applied to the modulationscheme having a higher modulation order than the QPSK without causingSNR deterioration.

A method for using channel selection, i.e., a method for receivingmultiple resources and using a resource selection domain as UCIinformation, will hereinafter be described in detail. For convenience ofdescription and better understanding of the present invention, thefollowing description will focus upon an exemplary case in which oneresource (N=1) from among a total of two resources (M=2) is selected.Although the channel coding block can be omitted from the followingdescription and drawings, it is assumed that the channel coding blockexists for convenience of description and better understanding of thepresent invention.

Although a specific PRB including multiple resources for channelselection is not specially limited, it is assumed that the specific PRBis present in the same PRB for convenience of description. Multipleresources for channel selection may be explicitly allocated throughphysical channel signaling (e.g., PDCCH) or higher layer (e.g., RRC,MAC, BCH) signaling. In addition, the multiple resources for channelselection may be implicitly allocated in the same manner as in dynamicACK/NACK resource allocation of the legacy LTE.

Allocation of multiple resources using the dynamic ACK/NACK resourceallocation of the legacy LTE will hereinafter be described in detail.For convenience of description, it is assumed that two orthogonalresources (ORs) for channel selection are used (M=2). In this case, thefirst orthogonal resource (OR) index is determined to be an indexcorresponding to the lowest CCE index of a DL grant PDCCH, and thesecond orthogonal resource (OR) index may be obtained by combining thefirst OR index and an offset value. The offset value is not speciallylimited. For example, the offset value may be set to 1.

If multiple resources for channel selection are limited to a cyclicshift (CS) domain, the second orthogonal resource index can berepresented as a modulo format of a total number of cyclic shifts (e.g.,12 cyclic shifts). For example, the cyclic shift (CS) index of thesecond orthogonal resource may be denoted by(n_(CS,OR1)+offset)mod(12)=0. n_(CS, OR1) is a CS index of the firstorthogonal resource, and mod is a modulo operation. In this case,multiple resources for channel selection are assigned different cyclicshifts.

In another example, assuming that multiple resources for channelselection are limited to cyclic shift (CS) and orthogonal code (i.e.,assuming that multiple resources for channel selection are limited toresources belonging to the same PRB), if the number of availableresources of one PRB is set to 18, an index of the second orthogonalresource may be denoted by (n_(OR1)+offset)mod(18)=0. n_(OR1) is anindex of the first orthogonal resource within the PRB. In this case, theorthogonal resource index represents a combination of a cyclic shift(CS) and an orthogonal code (OC).

FIG. 32 shows a PUCCH format to which channel selection and SF reductionare applied, and signal processing for the PUCCH format according to oneembodiment of the present invention.

The channel coding block shown in FIG. 32 is provided for convenience ofdescription, and may be omitted as necessary. Basic signal processingother than channel selection is identical to those of FIGS. 30 and 31.

Referring to FIG. 32, the modulator can perform modulation mapping inconsideration of channel selection. For example, referring to Slot 0,the modulator generates four modulation symbols (0, 1, 2, 3) from theencoded bits. The modulation symbols (0, 2) correspond to the firstorthogonal resource, and the modulation symbols (1, 3) corresponds tothe second orthogonal resource. The first orthogonal resource and thesecond orthogonal resource are limited to cyclic shift (CS) andorthogonal code (OC). In the drawings, the same-number cyclic shifts(i.e., cyclic shift M (e.g., M=0 and M=1)) indicate cyclic shiftsderived from the same orthogonal resource, but the derived cyclic shiftsmay not always have the same numbers. For example, if CS hopping isapplied at an SC-FDMA or slot level, the cyclic shift M may have adifferent value according to an SC-FDMA symbol or slot. In theorthogonal codes (wa,b) (e.g., [w0,1; w1,1],[w2,1; w3,1] or [w0,1; w1,1;w2,1; w3,1]), a is an element index in an orthogonal code, and b is anorthogonal code index.

In response to channel selection, the modulator applies an actualmodulation value to only one of the modulation symbols 0 and 1, andapplies the value of 0 to the remaining one. Likewise, the modulatorapplies an actual modulation value to only one of the modulation symbols2 and 3, and applies the value of 0 to the remaining one. The channelselection may be independently performed per modulation symbol, so thatthe first orthogonal resource is selected at SC-FDMA symbols 0˜1 and thesecond orthogonal resource is selected at SC-FDMA symbols 5˜6.

Although not shown in the drawings, the above-mentioned channelselection process may be equivalently carried out in the resourcedomain. For example, the modulator generates two modulation symbols (0,1) respectively corresponding to the SC-FDMA symbols 0˜1 and the SC-FDMAsymbols 5˜6. Thereafter, according to the channel selection result, oneof the first orthogonal resource and the second orthogonal resource maybe applied to the modulation symbol 0. Likewise, one of the firstorthogonal resource and the second orthogonal resource may be applied tothe modulation symbol 1.

The same physical result can be obtained irrespective of whetherresource selection is performed either in the modulator or the resourcedomain. For convenience of description, it is assumed that resourceselection to be described in the following description be achievedthrough the modulator for convenience of description and betterunderstanding of the present invention. Although the modulation order isnot specially limited, it should be noted that QPSK or 8PSK modulationmay be specially carried out as necessary.

An exemplary case in which UCI corresponds to multiple ACK/NACKinformation will hereinafter be described in detail. The multipleACK/NACK information includes ACK/NACK information of data received froma plurality of DL CCs. The channel coding block performs joint coding ofmultiple ACK/NACK information such that it generates a single codeword.The channel coding scheme includes, for example, RM-based coding, TBCC,or turbo-coding. Thereafter, the encoded bit (i.e., codeword) may berate-matched. The rate-matching scheme includes cyclic buffer ratematching. In addition, the rate matching may include puncturing throughwhich only the desired size of coded bits remains from the codeword. Forexample, it is assumed that RM coding (20, A) for use in LTE PUCCH isused. If four QPSK modulation symbols are used in case of M=2 and N=1,12 encoded bits (or 12 coded bits) are needed. In this case, the encodedbits of a length 20 are generated from the LTE RM (20, A), the latter 8bits may be punctured. Provided that RM supports the size of (8, A),cyclic buffer rate matching can be performed in such a manner that theencoded bits of the length 8 are generated and the resultant coded bitshave the length of 12 ([a0, a1, . . . , a7, a0, a1, a2, a3]=>length of12). Provided that four 8PSK modulation symbols are used in case of M=2and N=1, a total of 16 coded bits are needed. In this case, theinformation bits are encoded into 20 bits using LTE RM (20,A), and arethen punctured to be 16 bits.

After completion of channel coding, the encoded bits are modulated in amanner that the encoded bits can be mapped to a physical channel. Inthis example, the modulator generates a total of 8 modulation symbolsusing QPSK or 8PSK modulation. If M=2 and N=1, only one of Symbol 0 andSymbol 1 has an actual modulation symbol value, and the remaining onemay be set to zero. The above-mentioned concept can also be applied toSymbol 2 and Symbol 3 in the same manner as described above. Forconvenience of description, the above-mentioned concept in which one oftwo symbols is set to zero can be conceptually covered by a symbolexpression method. Thereafter, two orthogonal resources are applied toSymbol 0 and Symbol 1. Likewise, two orthogonal resources can also beapplied to Symbol 2 and Symbol 3. It is assumed that the orthogonalresources are composed of OS0=(CS0,OC0) and OS1=(CS1,OC1) and arepresent in the same PRB.

In more detail, in case of using channel selection, UCI can betransmitted as follows.

-   -   Modulation symbol 0 is transmitted through SC-FDMA symbols 0˜1        of Slot 0 through OS0.    -   Modulation symbol 1 is transmitted through SC-FDMA symbols 0˜1        of Slot 0 through OS1.    -   Modulation symbol 2 is transmitted through SC-FDMA symbols 5˜6        of Slot 0 through OS0.    -   Modulation symbol 3 is transmitted through SC-FDMA symbols 5˜6        of Slot 0 through OS1.    -   Modulation symbol 4 is transmitted through SC-FDMA symbols 0˜1        of Slot 1 through OS0.    -   Modulation symbol 5 is transmitted through SC-FDMA symbols 0˜1        of Slot 1 through OS1.    -   Modulation symbol 6 is transmitted through SC-FDMA symbols 5˜6        of Slot 1 through OS0.    -   Modulation symbol 7 is transmitted through SC-FDMA symbols 5˜6        of Slot 1 through OS0.

Cyclic shift may be cell-specifically hopped in units of an SC-FDMAsymbol. OC may define the hopping pattern either in units of amodulation symbol or in units of a slot. Through the above-mentionedtransmission method, signal carrier characteristics can be satisfiedwithout increasing CM as compared to LTE.

The channel selection process for use in QPSK modulation willhereinafter be described in detail. Assuming that 4 QPSK modulationsymbols are transmitted through one of two resources, 12 coded bits (b0,. . . , b11) are obtained from ACK/NACK information after completion ofthe channel coding and rate matching. 3 coded bits correspond to onecombination (one modulation symbol or one resource selection) and theencoded bit sequence can be modulated into s0, . . . , s7. In accordancewith the channel selection, each of four elements from among s0, . . . ,s7 has an actual modulation value, and each of the remaining fourelements is set to zero.

Table 14 exemplarily shows the mapping rule after QPSK modulation. Table15 shows the application result of Table 14 in case that the encoded bitsequences are denoted by <b0, . . . , b11>=<1,1,1, 0,1,0, 1,0,0, 0,0,1>.

TABLE 14 I_(cs1) I_(cs2) Encoded Bits I Q I Q 000 1/{square root over(2)} 1/{square root over (2)} 001 1/{square root over (2)} −1/{squareroot over (2)} 010 −1/{square root over (2)} 1/{square root over (2)}011 −1/{square root over (2)} −1/{square root over (2)} 100 1/{squareroot over (2)} 1/{square root over (2)} 101 1/{square root over (2)}−1/{square root over (2)} 110 −1/{square root over (2)} 1/{square rootover (2)} 111 −1/{square root over (2)} −1/{square root over (2)}

In Table 14, I_(CS1) is a first orthogonal resource index, and I_(CS2)is a second orthogonal resource index. A blank denotes zero (0). I is anin-phase component and Q is a quadrature phase component.

TABLE 15 s0 s1 s2 s3 s4 s5 s6 s7 I 0 −1/{square root over (2)}−1/{square root over (2)} 0 0 1/{square root over (2)}  1/{square rootover (2)} 0 Q 0 −1/{square root over (2)}  1/{square root over (2)} 0 01/{square root over (2)} −1/{square root over (2)} 0

Table 14 can be modified into another equivalent format. For example,the mapping rule of Table 14 can be modified using the QPSK mappingtable for use in the LTE PUCCH format. Table 16 shows the QPSK mappingtable defined in the LTE PUCCH format 1a/1b, and Table 17 shows themapping rule based on QPSK constellation.

TABLE 16 PUCCH format ACK/NACK d(0) 1a 0  1 1 −1 1b 00  1 01 −j 10 J 11−1

TABLE 17 ACK/NACK 1st ACK/NACK 2nd ACK/NACK Bits resource resource 000 1 001 −j 010 J 011 −1 100  1 101 −j 110 J 111 −1

Table 18 shows another mapping rule for use in QPSK modulation. Themapping rule of Table 18 has been designed considering the Euclediandistance. FIG. 33 shows QPSK constellation based on the mapping rule ofTable 18. The Eucledian distance reaches the longest distance betweensymbols located at a diagonal line. The longer the Eucledian distance,the lowest the probability of generating errors between symbols. Themapping rule shown in Table 18 and FIG. 33 is configured in a mannerthat a specific bit having the longest Hamming distance is located at adiagonal line.

TABLE 18 I_(cs1) I_(cs2) Encoded Bits I Q I Q 000 −1/{square root over(2)} −1/{square root over (2)} 001 −1/{square root over (2)} −1/{squareroot over (2)} 010 −1/{square root over (2)} 1/{square root over (2)}011 −1/{square root over (2)} 1/{square root over (2)} 100 1/{squareroot over (2)} −1/{square root over (2)} 101 1/{square root over (2)}−1/{square root over (2)} 110 1/{square root over (2)} 1/{square rootover (2)} 111 1/{square root over (2)} 1/{square root over (2)}

Assuming that the encoded bit sequence is denoted by <b0, . . . ,b11>=<1,1,1, 0,1,0, 1,0,0, 0,0,1>, Table 19 shows the application resultof Table 18.

TABLE 19 s0 s1 s2 s3 s4 s5 s6 s7 I 1/{square root over (2)} 0 −1/{squareroot over (2)} 0 0  1/{square root over (2)} 0 −1/{square root over (2)}Q 1/{square root over (2)} 0  1/{square root over (2)} 0 0 −1/{squareroot over (2)} 0 −1/{square root over (2)}

The channel selection procedure for use in 8PSK modulation willhereinafter be described in detail.

Provided that 4 8PSK modulation symbols are transmitted through one oftwo resources, 16 coded bits (b0, . . . , b15) are obtained fromACK/NACK information after completion of the channel coding and ratematching. Four coded bits correspond to one combination of [modulationsymbol, resource selection], and the encoded bit sequence may bemodulated into s0, . . . , s7. In accordance with the channel selection,each of four elements from among s0, . . . , s7 has an actual modulationvalue, and each of the remaining four elements is set to zero.

Table 20 shows the mapping rule for use in 8PSK modulation. The mappingrule of Table 20 has been designed considering the Eucledian distance.FIG. 34 shows QPSK constellation based on the mapping rule of Table 20.Referring to FIG. 34, the modulation symbols are arranged on the basisof gray mapping so as to obtain an optimum Eucledian distance. A highercoding gain can be obtained through 8PSK mapping.

TABLE 20 I_(cs1) I_(cs2) Encoded Bits I Q I Q 0000 −1/{square root over(2)} −1/{square root over (2)} 0001 −1  0 0010 −1  0 0011 −1/{squareroot over (2)} −1/{square root over (2)} 0100 0 1 0101 −1/{square rootover (2)} 1/{square root over (2)} 0 0 0110 −1/{square root over (2)}1/{square root over (2)} 0111 0 1 1000 0 −1  1001 1/{square root over(2)} −1/{square root over (2)} 1010 1/{square root over (2)} −1/{squareroot over (2)} 1011 0 −1  1100 1/{square root over (2)} 1/{square rootover (2)} 1101 1 0 1110 1 0 1111 1/{square root over (2)} 1/{square rootover (2)}

In Table 20, I_(CS1) is a first orthogonal resource index, and I_(CS2)is a second orthogonal resource index. A blank denotes zero (0). I is anin-phase component and Q is a quadrature phase component.

Assuming that the encoded bit sequence is denoted by <b0, . . . ,b15>=<1,1,0,1, 1,0,0,0, 1,0,1,0, 1,0,1,1>, Table 21 shows theapplication result of Table 20.

TABLE 21 s0 s1 s2 s3 s4 s5 s6 s7 I 0 1 0 0  1/{square root over (2)} 0 00 Q 0 0 −1 0 −1/{square root over (2)} 0 0 −1

Table 22 exemplarily shows another mapping rule for use in 8PSKmodulation. Assuming that the encoded bit sequence is denoted by <b0, .. . , b15>=<1,1,0,1, 1,0,0,0, 1,0,1,0, 1,0,1,1>, Table 23 shows theapplication result of Table 20.

TABLE 22 I_(cs1) I_(cs2) Encoded Bits I Q I Q 0000 −1/{square root over(2)} −1/{square root over (2)} 0001 0 −1  0010 0 −1  0011 −1/{squareroot over (2)} −1/{square root over (2)} 0100 −1  0 0101 1/{square rootover (2)} −1/{square root over (2)} 0110 1/{square root over (2)}−1/{square root over (2)} 0111 −1  0 1000 1/{square root over (2)}1/{square root over (2)} 1001 0 1 1010 0 1 1011 1/{square root over (2)}1/{square root over (2)} 1100 1 0 1101 −1/{square root over (2)}1/{square root over (2)} 1110 −1/{square root over (2)} 1/{square rootover (2)} 1111 1 0

TABLE 23 s0 s1 s2 s3 s4 s5 s6 s7 I 0 −1/{square root over (2)} 01/{square root over (2)} 0 0 1/{square root over (2)} 0 Q 0  1/{squareroot over (2)} 0 1/{square root over (2)} 0 1 1/{square root over (2)} 0

The following description shows an example for applying precoding tochannel selection, so that the amount of payload can be increased and arelatively low CM can be achieved. For convenience of description, thefollowing description will focus upon an exemplary case in whichprecoding is applied to the 8PSK mapping table.

FIG. 35 is a block diagram illustrating precoding applied to channelselection. Payload (UCI) is converted into the encoded bits by theencoding block 910. By the resource selection and mapping module 920,the encoded bits are mapped and converted into the modulation symbolsaccording to the predetermined modulation scheme. By the precodingmodule 930, the modulation symbols are precoded using the precodingmatrix (or a precoding vector) corresponding to the resource index. Eachrow of the precoding matrix corresponds to a resource index. Theprecoded modulation symbol is spread to a sequence corresponding to thecorresponding resource index. By the resource mapping module 950, thespread sequence is mapped to a physical resource and then transmitted.

FIG. 36 exemplarily shows 8PSK constellation based on gray mapping.Table 24 exemplarily shows the mapping rule considering constellation ofFIG. 35.

TABLE 24 Encoded Bits I Q 000 −1/{square root over (2)} −1/{square rootover (2)} 001 −1  0 010 0 1 011 −1/{square root over (2)} 1/{square rootover (2)} 100 0 −1  101 1/{square root over (2)} −1/{square root over(2)} 110 1/{square root over (2)} 1/{square root over (2)} 111 1 0

As can be seen from Equation 10, the precoding vector [+1+1] is appliedto the first resource index and the precoding vector [+1 −1] is appliedto the second resource index I_(CS2).

$\begin{matrix}{\begin{pmatrix}I_{{cs}\; 1} \\I_{{cs}\; 2}\end{pmatrix} = {\begin{pmatrix}1 & 1 \\1 & {- 1}\end{pmatrix}\begin{pmatrix}{d(i)} \\{d\left( {i + 1} \right)}\end{pmatrix}}} & \left\lbrack {{Equation}\mspace{14mu} 10} \right\rbrack\end{matrix}$

For example, as can be seen from Table 24, assuming that the precodingvector [+1+1] is applied not only to modulation symbols (−0, 1)corresponding to bits (001), but also to modulation symbols (0, 1)corresponding to bits (010), symbols (−1, 1) can be achieved and appliedto the first resource index I_(cs1). In addition, assuming that theprecoding vector [+1 −1] is applied not only to symbols (−1, 0)corresponding to bits (001) but also to modulation symbols (0, 1)corresponding to bits (010), symbols (−1, −1) can be achieved andapplied to the second resource index I_(cs2). If precoding and tworesource indices are used, the encoded bits mapped to one modulationsymbol can be extended from 3 bits to 6 bits.

Table 25 exemplarily shows the mapping rule used when precoding isapplied to 8PSK precoding of Table 24. Table 25 assumes that oneresource is selected from two resource indices (for example, cyclicshift (CS) indices (I_(cs1), I_(cs2))).

TABLE 25 I_(cs1) I_(cs2) Encoded Bits I Q I Q 000000 −1/{square rootover (2)} − 1/{square root over (2)} −1/{square root over (2)} −1/{square root over (2)} 0 0 000001 −1/{square root over (2)} − 1−1/{square root over (2)} −1/{square root over (2)} + 1 −1/{square rootover (2)} 000010 −1/{square root over (2)} −1/{square root over (2)} + 1−1/{square root over (2)} −1/{square root over (2)} − 1 000011−1/{square root over (2)} − 1/{square root over (2)} 0 0 −1/{square rootover (2)} − 1/{square root over (2)} 000100 −1/{square root over (2)}−1/{square root over (2)} − 1 −1/{square root over (2)} −1/{square rootover (2)} + 1 000101 0 −1/{square root over (2)} − 1/{square root over(2)} −1/{square root over (2)} − 1/{square root over (2)} 0 000110 0 0−1/{square root over (2)} − 1/{square root over (2)} −1/{square rootover (2)} − 1/{square root over (2)} 000111 −1/{square root over (2)} +1 −1/{square root over (2)} −1/{square root over (2)} − 1 −1/{squareroot over (2)} 001000 −1 − 1/{square root over (2)} −1/{square root over(2)} −1 + 1/{square root over (2)} −1/{square root over (2)} 001001 −1 −1 0 0 0 001010 −1  1 −1  −1  001011 −1 − 1/{square root over (2)}1/{square root over (2)} −1 + 1/{square root over (2)} −1/{square rootover (2)} 001100 −1  −1  −1  1 001101 −1 + 1/{square root over (2)}−1/{square root over (2)} −1 − 1/{square root over (2)} 1/{square rootover (2)} 001110 −1 + 1/{square root over (2)} 1/{square root over (2)}−1 − 1/{square root over (2)} −1/{square root over (2)} 001111 0 0 −1 −1 0 010000 −1/{square root over (2)} 1 − 1/{square root over (2)}1/{square root over (2)} 1 + 1/{square root over (2)} 010001 −1  1 1 1010010 0 1 + 1 0 0 010011 −1/{square root over (2)} 1 + 1/{square rootover (2)} 1/{square root over (2)} 1 − 1/{square root over (2)} 010100 00 0 1 + 1 010101 1/{square root over (2)} 1 − 1/{square root over (2)}−1/{square root over (2)} 1 + 1/{square root over (2)} 010110 1/{squareroot over (2)} 1 + 1/{square root over (2)} −1/{square root over (2)} 1− 1/{square root over (2)} 010111 1 1 −1  1 011000 −1/{square root over(2)} − 1/{square root over (2)} 0 0 1/{square root over (2)} + 1/{squareroot over (2)} 011001 −1 − 1/{square root over (2)} 1/{square root over(2)} 1 − 1/{square root over (2)} 1/{square root over (2)} 011010−1/{square root over (2)} 1 + 1/{square root over (2)} −1/{square rootover (2)} −1 + 1/{square root over (2)} 011011 −1/{square root over (2)}− 1/{square root over (2)} 1/{square root over (2)} + 1/{square rootover (2)} 0 0 011100 −1/{square root over (2)} −1 + 1/{square root over(2)} −1/{square root over (2)} 1 + 1/{square root over (2)} 011101 0 0−1/{square root over (2)} − 1/{square root over (2)} 1/{square root over(2)} + 1/{square root over (2)} 011110 0 1/{square root over (2)} +1/{square root over (2)} −1/{square root over (2)} − 1/{square root over(2)} 0 011111 1 − 1/{square root over (2)} 1/{square root over (2)} −1 −1/{square root over (2)} 1/{square root over (2)} 100000 −1/{square rootover (2)} −1 − 1/{square root over (2)} 1/{square root over (2)} −1 +1/{square root over (2)} 100001 −1  −1  1 −1  100010 0 0 0 −1 − 1 100011−1/{square root over (2)} −1 + 1/{square root over (2)} 1/{square rootover (2)} −1 − 1/{square root over (2)} 100100 0 −1 − 1 0 0 1001011/{square root over (2)} −1 − 1/{square root over (2)} −1/{square rootover (2)} −1 + 1/{square root over (2)} 100110 1/{square root over (2)}−1 + 1/{square root over (2)} −1/{square root over (2)} −1 − 1/{squareroot over (2)} 100111 1 −1  −1  −1  101000 0 −1/{square root over (2)} −1/{square root over (2)} 1/{square root over (2)} + 1/{square root over(2)} 0 101001 −1 + 1/{square root over (2)} −1/{square root over (2)}1 + 1/{square root over (2)} −1/{square root over (2)} 101010 1/{squareroot over (2)} 1 − 1/{square root over (2)} 1/{square root over (2)} −1− 1/{square root over (2)} 101011 0 0 1/{square root over (2)} +1/{square root over (2)} −1/{square root over (2)} − 1/{square root over(2)} 101100 1/{square root over (2)} −1 − 1/{square root over (2)}1/{square root over (2)} 1 − 1/{square root over (2)} 101101 1/{squareroot over (2)} + 1/{square root over (2)} −1/{square root over (2)} −1/{square root over (2)} 0 0 101110 1/{square root over (2)} + 1/{squareroot over (2)} 0 0 −1/{square root over (2)} − 1/{square root over (2)}101111 1 + 1/{square root over (2)} −1/{square root over (2)} −1 +1/{square root over (2)} −1/{square root over (2)} 110000 0 0 1/{squareroot over (2)} + 1/{square root over (2)} 1/{square root over (2)} +1/{square root over (2)} 110001 −1 + 1/{square root over (2)} 1/{squareroot over (2)} 1 + 1/{square root over (2)} 1/{square root over (2)}110010 1/{square root over (2)} 1 + 1/{square root over (2)} 1/{squareroot over (2)} −1 + 1/{square root over (2)} 110011 0 1/{square rootover (2)} + 1/{square root over (2)} 1/{square root over (2)} +1/{square root over (2)} 0 110100 1/{square root over (2)} −1 +1/{square root over (2)} 1/{square root over (2)} 1 + 1/{square rootover (2)} 110101 1/{square root over (2)} + 1/{square root over (2)} 0 0−1/{square root over (2)} − 1/{square root over (2)} 110110 1/{squareroot over (2)} + 1/{square root over (2)} 1/{square root over (2)} +1/{square root over (2)} 0 0 110111 1 + 1/{square root over (2)}1/{square root over (2)} −1 + 1/{square root over (2)} 1/{square rootover (2)} 111000 1 − 1/{square root over (2)} −1/{square root over (2)}1 + 1/{square root over (2)} 1/{square root over (2)} 111001 0 0 1 + 1 0111010 1 1 1 −1  111011 1 − 1/{square root over (2)} 1/{square root over(2)} 1 + 1/{square root over (2)} −1/{square root over (2)} 111100 1 −1 1 1 111101 1 + 1/{square root over (2)} −1/{square root over (2)} 1 −1/{square root over (2)} 1/{square root over (2)} 111110 1 + 1/{squareroot over (2)} 1/{square root over (2)} 1 − 1/{square root over (2)}−1/{square root over (2)} 111111 1 + 1 0 0 0

In Table 25, the number of encoded bits mapped to one modulation symbolis set to 6. In this case, the modulation symbol indicates a set of twomodulated symbols for two resource indices.

In the modified example of Table 25, only some modulation symbols eachhaving a low PAPR/CM are selected from Table 23 (that is, modulationsymbols are selected in a manner that a signal is present in only oneresource and the value of 0 is transmitted to the remaining resources),so that a new mapping table can be configured. For example, onlymodulation symbols corresponding to (000000), (000110) and (001001) areselected from Table 25 so as to configure a reduced mapping table, andthe encoded bits can be newly mapped according to the reduced mappingtable. In this case, although the amount of UCI transmission informationis reduced, the above modified example has an advantage in terms ofpower control.

The transmit diversity methods according to the present invention willhereinafter be described in detail.

The first transmit diversity scheme will hereinafter be described indetail.

The first transmit diversity scheme relates to a transmit diversitymethod in which the Alamouti code is applied to an orthogonal resourcedomain and an antenna domain. For convenience of description and betterunderstanding of the present invention, it is assumed that the number ofTx antennas is set to 2. Two RS orthogonal resources may be used toperform channel estimation for each antenna. In other words, in order toperform channel estimation per antenna, a first orthogonal resource ofan RS symbol can be transmitted to a first antenna and a secondorthogonal resource of the RS symbol can be transmitted to a secondantenna. In addition, although the present invention has disclosed onlySlot 0 for convenience of description, it should be noted that thepresent invention can also be applied to Slot 1.

FIG. 37 shows a method for transmitting control information to Antenna 0using the first transmit diversity scheme, and FIG. 38 shows a methodfor transmitting control information to Antenna 1 using the firsttransmit diversity scheme. Referring to FIGS. 37 and 383, a modulationsymbol transmitted through Antenna 0 can be transmitted in the samemanner as in 1Tx transmission. On the other hand, the Alamouti codingfor use in an orthogonal resource domain is applied to the modulationsymbol transmitted through Antenna 1. In this case, the Alamouti codingmay include not only a matrix shown in Equation 11 but also all unitaryconversion formats for the matrix.

In Equation 11, (.)* is denoted by a complex conjugate operation of (.).

In the present invention, one of s0 and s1 is certainly set to zero, sothat Equation 11 can be modified into Equation 12.

For example, assuming that s2=s1=0 is provided in case of SC-FDMAsymbols 0 and 1, the following transmission can be achieved at Slot 0 ofeach antenna.

Antenna 0

-   -   Through OS0, a modulation symbol (s0) is transmitted through        SC-FDMA symbols 0˜1 of Slot 0.    -   Through OS1, a modulation symbol (s1=0) is transmitted through        SC-FDMA symbols 0˜1 of Slot 0.    -   Through OS0, a modulation symbol (s2=0) is transmitted through        SC-FDMA symbols 5˜6 of Slot 0.    -   Through OS1, a modulation symbol (s3) is transmitted through        SC-FDMA symbols 5˜6 of Slot 0.

Antenna 1

-   -   Through OS0, a modulation symbol −(s1)* is transmitted through        SC-FDMA symbols 0˜1 of Slot 0.    -   Through OS1, a modulation symbol (s0)* is transmitted through        SC-FDMA symbols 0˜1 of Slot 0.    -   Through OS0, a modulation symbol −(s3)* is transmitted through        SC-FDMA symbols 5˜6 of Slot 0.    -   Through OS1, a modulation symbol (s2)*=0 is transmitted through        SC-FDMA symbols 5˜6 of Slot 0.

In FIGS. 37 and 38, although multiple orthogonal resources allocated tothe first antenna are different from multiple orthogonal resourcesallocated to the second antenna for convenience of description and indexassignment reasons, the scope or spirit of the present invention is notlimited thereto, and can also be applied to other examples as necessary.Multiple orthogonal resources allocated to the first antenna areactually identical to multiple orthogonal resources allocated to thesecond antenna.

A method for applying precoding (e.g., an Alamouti code) for transmitdiversity to a time (i.e., an SC-FDMA symbol) domain and an antennadomain according to the second transmit diversity scheme willhereinafter be described in detail. For convenience of description, itis assumed that the number of Tx antennas is set to 2. Two RS orthogonalresources can be used for channel estimation for each antenna. In otherwords, in order to perform channel estimation per antenna, a firstorthogonal resource can be transmitted to a first antenna, and a secondorthogonal resource of the RS symbol can be applied to a second antenna.In addition, although Slot 0 is disclosed only for illustrativepurposes, it is apparent that the present invention can also be appliedto Slot 0 as necessary.

FIG. 39 shows a method for transmitting control information to Antenna 0using the second transmit diversity scheme, and FIG. 40 shows a methodfor transmitting control information to Antenna 1 using the secondtransmit diversity scheme. Referring to FIGS. 39 and 40, a modulationsymbol transmitted through Antenna 0 can be transmitted in the samemanner as in 1Tx transmission. On the other hand, Alamouti coding foruse in a time domain is applied to the modulation symbol transmittedthrough Antenna 1. That is, the Alamouti coding is applied to the sameorthogonal resource in units of an SC-FDMA symbol to which OC isapplied. In this case, the Alamouti coding may include not only a matrixshown in Equation 13 but also all unitary conversion formats for thematrix.

In Equation 13, (.)* is denoted by a complex conjugate operation of (.).

In the present invention, one of s0 and s1 is certainly set to zero, sothat Equation 13 can be modified into Equation 14.

For example, assuming that s2=s1=0 is provided in case of SC-FDMAsymbols 0, 1, 5 and 6, the following transmission can be achieved atSlot 0 of each antenna.

Antenna 0

-   -   Through OS0, a modulation symbol (s0) is transmitted through        SC-FDMA symbols 0˜1 of Slot 0.    -   Through OS1, a modulation symbol (s1=0) is transmitted through        SC-FDMA symbols 0˜1 of Slot 0.    -   Through OS0, a modulation symbol (s2=0) is transmitted through        SC-FDMA symbols 5˜6 of Slot 0.    -   Through OS1, a modulation symbol (s3) is transmitted through        SC-FDMA symbols 5˜6 of Slot 0.

Antenna 1

-   -   Through OS0, a modulation symbol −(s2)*=0 is transmitted through        SC-FDMA symbols 0˜1 of Slot 0.    -   Through OS1, a modulation symbol −(s3)* is transmitted through        SC-FDMA symbols 0˜1 of Slot 0.    -   Through OS0, a modulation symbol (s0)* is transmitted through        SC-FDMA symbols 5˜6 of Slot 0.    -   Through OS1, a modulation symbol (s1)*=0 is transmitted through        SC-FDMA symbols 5˜6 of Slot 0.

In FIGS. 39 and 40, although multiple orthogonal resources allocated tothe first antenna are different from multiple orthogonal resourcesallocated to the second antenna for convenience of description and indexassignment reasons, the scope or spirit of the present invention is notlimited thereto, and can also be applied to other examples as necessary.Multiple orthogonal resources allocated to the first antenna areactually identical to multiple orthogonal resources allocated to thesecond antenna.

A transmit diversity or spatial multiplexing scheme in which amodulation symbol is transmitted through different orthogonal resourcesat each antenna according to a third transmit diversity scheme willhereinafter be described in detail. That is, two orthogonal resourcescorresponding to the number of antennas can be further allocated, andthe same information can be transmitted using the same format throughindividual resources. In this case, after joint coding is performedconsidering the extended symbol space, different modulation symbols aretransmitted through individual orthogonal resources, so that spatialmultiplexing can be achieved.

FIG. 41 shows a method for transmitting control information to Antenna 0using a third transmit diversity scheme, and FIG. 42 shows a method fortransmitting control information to Antenna 1 using the third transmitdiversity scheme. Resources allocated for the second antenna may bedefined as an offset value of a resource used in the first antenna, andthe offset value may be set to 1. In relation to a CCE index, thesmallest CCE index may be used for the first antenna, and the next CCEindex may be used for the second antenna. If a DL grant PDCCH has a CCEaggregation level of 2 or more, the DL grant PDCCH can be efficientlyused without resource consumption.

For example, assuming that s2=s1=0 is provided in case of SC-FDMAsymbols 0, 1, 5 and 6, the following transmission can be achieved atSlot 0 of each antenna.

Antenna 0

-   -   Through OS0_0, a modulation symbol (s0) is transmitted through        SC-FDMA symbols 0˜1 of Slot 0.    -   Through OS1_0, a modulation symbol (s1=0) is transmitted through        SC-FDMA symbols 0˜1 of Slot 0.    -   Through OS0_0, a modulation symbol (s2=0) is transmitted through        SC-FDMA symbols 5˜6 of Slot 0.    -   Through OS1_0, a modulation symbol (s3) is transmitted through        SC-FDMA symbols 5˜6 of Slot 0.

Antenna 1

-   -   Through OS0_1, a modulation symbol (s0) is transmitted through        SC-FDMA symbols 0˜1 of Slot 0.    -   Through OS1_1, a modulation symbol (s1=0) is transmitted through        SC-FDMA symbols 0˜1 of Slot 0.    -   Through OS0_1, a modulation symbol (s2=0) is transmitted through        SC-FDMA symbols 5˜6 of Slot 0.    -   Through OS1_1, a modulation symbol (s3) is transmitted through        SC-FDMA symbols 5˜6 of Slot 0.

In case of using the spatial multiplexing scheme, modulation symbolss0˜s3 transmitted at Antenna 0 have information different from those ofmodulation symbols s0-s3 transmitted at Antenna 1.

FIG. 43 is a block diagram illustrating a base station (BS) and a userequipment (UE) applicable to embodiments of the present invention.

Referring to FIG. 43, the wireless communication system includes a basestation (BS) 110 and a UE 120. The BS 110 includes a processor 112, amemory 114, and a radio frequency (RF) unit 116. The processor 112 maybe constructed to implement the procedures and/or methods disclosed inthe embodiments of the present invention. The memory 114 may beconnected to a processor 112, and store various information related tooperations of the processor 112. The RF unit 116 is connected to theprocessor 112, and transmits and/or receives RF signals. The UE 120includes a processor 122, a memory 124, and an RF unit 126. Theprocessor 122 may be constructed to implement the procedures and/ormethods disclosed in the embodiments of the present invention. Thememory 124 may be connected to a processor 122, and store variousinformation related to operations of the processor 122. The RF unit 126is connected to the processor 122, and transmits and/or receives RFsignals. The BS 110 and/or the UE 120 may include a single antenna ormultiple antennas.

The aforementioned embodiments are achieved by combination of structuralelements and features of the present invention in a predeterminedfashion. Each of the structural elements or features should beconsidered selectively unless specified otherwise. Each of thestructural elements or features may be carried out without beingcombined with other structural elements or features. Also, somestructural elements and/or features may be combined with one another toconstitute the embodiments of the present invention. The order ofoperations described in the embodiments of the present invention may bechanged. Some structural elements or features of one embodiment may beincluded in another embodiment, or may be replaced with correspondingstructural elements or features of another embodiment. Moreover, it willbe apparent that some claims referring to specific claims may becombined with other claims referring to claims other than the specificclaims to constitute the embodiment or add new claims by means ofamendment after the application is filed.

The embodiments of the present invention have been described based ondata transmission and reception between a BS (or eNB) and a UE. Aspecific operation which has been described as being performed by theeNB (or BS) may be performed by an upper node of the eNB (or BS) as thecase may be. In other words, it will be apparent that various operationsperformed for communication with the UE in the network which includes aplurality of network nodes along with the eNB (or BS) can be performedby the BS or network nodes other than the eNB (or BS). The term eNB (orBS) may be replaced with terms such as fixed station, Node B, eNode B(eNB), and access point. Also, the term UE may be replaced with termssuch as mobile station (MS) and mobile subscriber station (MSS).

The embodiments according to the present invention can be implemented byvarious means, for example, hardware, firmware, software, orcombinations thereof. If the embodiment according to the presentinvention is implemented by hardware, the embodiment of the presentinvention can be implemented by one or more application specificintegrated circuits (ASICs), digital signal processors (DSPs), digitalsignal processing devices (DSPDs), programmable logic devices (PLDs),field programmable gate arrays (FPGAs), processors, controllers,microcontrollers, microprocessors, etc.

If the embodiment according to the present invention is implemented byfirmware or software, the embodiment of the present invention may beimplemented by a module, a procedure, or a function, which performsfunctions or operations as described above. Software code may be storedin a memory unit and then may be driven by a processor. The memory unitmay be located inside or outside the processor to transmit and receivedata to and from the processor through various well known means.

It will be apparent to those skilled in the art that the presentinvention can be embodied in other specific forms without departing fromthe spirit and essential characteristics of the invention. Thus, theabove embodiments are to be considered in all respects as illustrativeand not restrictive. The scope of the invention should be determined byreasonable interpretation of the appended claims and all changes whichcome within the equivalent scope of the invention are included in thescope of the invention.

[Industrial Applicability]

Exemplary embodiments of the present invention can be applied to a userequipment (UE), a base station (BS), and other devices. In more detail,the present invention can be applied to a method and apparatus fortransmitting uplink control information.

The invention claimed is:
 1. A method for transmitting controlinformation through a Physical Uplink Control Channel (PUCCH) by a userequipment (UE) in a wireless communication system, the methodcomprising: obtaining a first modulation symbol and a second modulationsymbol from the control information; spreading the first modulationsymbol to a plurality of first contiguous Single Carrier-FrequencyDivision Multiple Access (SC-FDMA) symbols in a time domain; spreadingthe second modulation symbol to a plurality of second contiguous SC-FDMAsymbols in the time domain; and transmitting the spread first modulationsymbol and the spread second modulation symbol through the PUCCH,wherein the plurality of first contiguous SC-FDMA symbols and theplurality of second contiguous SC-FDMA symbols are located in a sameslot, and wherein an index related to a first resource, from among aplurality of resources, occupied for the first or second modulationsymbol is decided by a Control Channel Element (CCE) index used forPhysical Downlink Control Channel (PDCCH) transmission, and an indexrelated to a second resource, from among the plurality of resources, isdecided by the index related to the first resource and an offset value.2. The method according to claim 1, wherein the first modulation symboland the second modulation symbol are obtained from channel-coded controlinformation.
 3. The method according to claim 2, wherein: the controlinformation includes a plurality of control information, and the firstmodulation symbol and the second modulation symbol are obtained from asingle codeword generated through joint coding.
 4. The method accordingto claim 1, wherein: the first modulation symbol is transmitted usingany one of a plurality of resources occupied in the plurality of firstcontiguous SC-FDMA symbols, and the second modulation symbol istransmitted using any one of a plurality of resources occupied in theplurality of second contiguous SC-FDMA symbols.
 5. The method accordingto claim 1, wherein a sequence used for time-domain spreading of thefirst modulation symbol and the second modulation symbol has a spreadingfactor (SF) of 2 (SF=2).
 6. The method according to claim 1, wherein asequence used for frequency-domain spreading of the first modulationsymbol and the second modulation symbol includes a Constant AmplitudeZero Auto Correlation (CAZAC) sequence or a Computer Generated(CG)-CAZAC sequence.
 7. A user equipment (UE) configured to transmitcontrol information through a physical uplink control channel (PUCCH) ina wireless communication system comprising: a radio frequency (RF)device; and a processor operatively connected to the RF device andconfigured to, obtain a first modulation symbol and a second modulationsymbol from the control information, spread the first modulation symbolto a plurality of first contiguous Single Carrier-Frequency DivisionMultiple Access (SC-FDMA) symbols in a time domain, spread the secondmodulation symbol to a plurality of second contiguous SC-FDMA symbols inthe time domain, and transmit the spread first modulation symbol and thespread second modulation symbol through the PUCCH, wherein the pluralityof first contiguous SC-FDMA symbols and the plurality of secondcontiguous SC-FDMA symbols are located in a same slot, and wherein anindex related to a first resource, from among a plurality of resources,occupied for the first or second modulation symbol is decided by aControl Channel Element (CCE) index used for Physical Downlink ControlChannel (PDCCH) transmission, and an index related to a second resource,from among the plurality of resources, is decided by the index relatedto the first resource and an offset value.
 8. The user equipment (UE)according to claim 7, wherein the first modulation symbol and the secondmodulation symbol are obtained from channel-coded control information.9. The user equipment (UE) according to claim 8, wherein: the controlinformation includes a plurality of control information, and the firstmodulation symbol and the second modulation symbol are obtained from asingle codeword generated through joint coding.
 10. The user equipment(UE) according to claim 7, wherein: the first modulation symbol istransmitted using any one of a plurality of resources occupied in theplurality of first contiguous SC-FDMA symbols, and the second modulationsymbol is transmitted using any one of a plurality of resources occupiedin the plurality of second contiguous SC-FDMA symbols.
 11. The userequipment (UE) according to claim 7, wherein a sequence used fortime-domain spreading of the first modulation symbol and the secondmodulation symbol has a spreading factor (SF) of 2 (SF=2).
 12. The userequipment (UE) according to claim 7, wherein a sequence used forfrequency-domain spreading of the first modulation symbol and the secondmodulation symbol includes a Constant Amplitude Zero Auto Correlation(CAZAC) sequence or a Computer Generated (CG)-CAZAC sequence.